Constructing pairs of equienergetic and non-cospectral graphs
نویسندگان
چکیده
منابع مشابه
Constructing pairs of equienergetic and non-cospectral graphs
The energy of a simple graph G is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs of the same order are said to be equienergetic if they have the same energy. Several ways to construct equienergetic non-cospectral graphs of very large size can be found in the literature. The aim of this work is to construct equienergetic non-cospectral graphs of small size....
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولConstructing cospectral graphs for the normalized Laplacian
We give a method to construct cospectral graphs for the normalized Laplacian by swapping edges between vertices in some special graphs. We also give a method to construct an arbitrarily large family of (non-bipartite) graphs which are mutually cospectral for the normalized Laplacian matrix of a graph. AMS 2010 subject classification: 05C50
متن کاملOpen problems for equienergetic graphs
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 pa...
متن کاملNon-Isomorphic Graphs with Cospectral Symmetric Powers
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2008
ISSN: 0893-9659
DOI: 10.1016/j.aml.2007.04.002