Revisiting Two Classical Results on Graph Spectra
نویسندگان
چکیده
منابع مشابه
Revisiting Two Classical Results on Graph Spectra
Let (G) and min (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G of order n and diameter D; then (G) (H) > 1 2D (G)n : (ii) If G is a connected nonbipartite graph of order n and diameter D, then (G) + min (G) > 2 2D (G)n : These bounds have the correct order of magnitude for large and D. ...
متن کاملSome results on Bipolar Fuzzy Graph
In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...
متن کاملon spectra of unitary cayley mixed graph
in this paper we introduce mixed unitary cayley graph $m_{n}$ $(n>1)$ and compute its eigenvalues. we also compute the energy of $m_{n}$ for some $n$.
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملRevisiting Information Hiding: Reflections on Classical and Nonclassical Modularity
What is modularity? Which kind of modularity should developers strive for? Despite decades of research on modularity, these basic questions have no definite answer. We submit that the common understanding of modularity, and in particular its notion of information hiding, is deeply rooted in classical logic. We analyze how classical modularity, based on classical logic, fails to address the need...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2007
ISSN: 1077-8926
DOI: 10.37236/932