• ورود به سامانه
      مشاهده مورد 
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Iranian Journal of Mathematical Chemistry
      • Volume 6, Issue 2
      • مشاهده مورد
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Iranian Journal of Mathematical Chemistry
      • Volume 6, Issue 2
      • مشاهده مورد
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Open problems for equienergetic graphs

      (ندگان)پدیدآور
      Gutman, Ivan
      Thumbnail
      نوع مدرک
      Text
      Review Article
      زبان مدرک
      English
      نمایش کامل رکورد
      چکیده
      The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Two graphs of the same order are said to be equienergetic if their energies are equal. We point out the following two open problems for equienergetic graphs. (1) Although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pair. (2) If by numerical calculation one finds that two non-cospectral graphs seem to be equienergetic, in the general case no method is known for proving that this indeed is the case.
      کلید واژگان
      Graph energy
      equienergetic graphs
      Spectrum (of graph)
      Spectral Graph Theory

      شماره نشریه
      2
      تاریخ نشر
      2015-10-01
      1394-07-09
      ناشر
      University of Kashan
      سازمان پدید آورنده
      Faculty of Science, University of Kragujevac, Kragujevac, Serbia

      شاپا
      2228-6489
      2008-9015
      URI
      https://dx.doi.org/10.22052/ijmc.2015.10844
      https://ijmc.kashanu.ac.ir/article_10844.html
      https://iranjournals.nlai.ir/handle/123456789/326151

      Related items

      Showing items related by title, author, creator and subject.

      • $Z_k$-Magic Labeling of Some Families of Graphs 

        Jeyanthi, P.؛ Jeyadaisy, K. (University of Tehran, 2018-12-01)
        For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ ...

      • Graphs with smallest forgotten index 

        Gutman, Ivan؛ Ghalavand, Ali؛ Dehghan-Zadeh, T.؛ Ashrafi, Ali Reza (University of Kashan, 2017-09-01)
        The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all ...

      • Note on degree Kirchhoff index of graphs 

        Hakimi-Nezhaad, Mardjan؛ Ashrafi, Ali Reza؛ Gutman, Ivan (University of Isfahan, 2013-09-01)
        The degree Kirchhoff index of a connected graph $G$ is defined as‎ ‎the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices‎, ‎where $d_i$ is the‎ ‎degree of the $i$-th vertex‎, ‎and $r_{ij}$ the resistance distance ...

      مرور

      همه جای سامانهپایگاه‌ها و مجموعه‌ها بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌هااین مجموعه بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌ها

      حساب من

      ورود به سامانهثبت نام

      تازه ترین ها

      تازه ترین مدارک
      © کليه حقوق اين سامانه برای سازمان اسناد و کتابخانه ملی ایران محفوظ است
      تماس با ما | ارسال بازخورد
      قدرت یافته توسطسیناوب