Results 11 to 20 of about 169,163 (265)
Determining Graphs by the Complementary Spectrum
Discussiones Mathematicae Graph Theory, 2020 The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum.
Pinheiro Lucélia K. +2 more
doaj +2 more sources
Spectrum of the Transposition graph
Linear Algebra and its Applications, 2022 Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of $T_n$ are integers. However, an explicit description of the spectrum is unknown. In this paper we prove that for any integer $k\geqslant 0$ there exists $n_0$ such that for any $n\geqslant n_0$ and any $m \
Elena V. Konstantinova, Artem Kravchuk
openaire +2 more sources
Relating Estrada index with spectral radius [PDF]
Journal of the Serbian Chemical Society, 2007 The Estrada index EE is a recently proposed molecular structure-descriptor, used in the modeling of certain features of the 3D structure of organic molecules, in particular of the degree of folding of proteins and other long-chain biopolymers.
Gutman Ivan +4 more
doaj +3 more sources
Spectrum of anti-gallai graph of some graphs
Indian Journal of Pure and Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palathingal, Jeepamol J. +2 more
openaire +2 more sources
Maximum Entropy Approach to Massive Graph Spectrum Learning with Applications
Algorithms, 2022 We propose an alternative maximum entropy approach to learning the spectra of massive graphs. In contrast to state-of-the-art Lanczos algorithm for spectral density estimation and applications thereof, our approach does not require kernel smoothing.
Diego Granziol +5 more
doaj +1 more source
The Spectrum of Triangle-Free Graphs
SIAM Journal on Discrete Mathematics, 2023 Denote by $q_n(G)$ the smallest eigenvalue of the signless Laplacian matrix of an $n$-vertex graph $G$. Brandt conjectured in 1997 that for regular triangle-free graphs $q_n(G) \leq \frac{4n}{25}$. We prove a stronger result: If $G$ is a triangle-free graph then $q_n(G) \leq \frac{15n}{94}< \frac{4n}{25}$.
Balogh, József +4 more
openaire +3 more sources
Distributed estimation of graph spectrum [PDF]
2015 American Control Conference (ACC), 2015 15 pages, 2 ...
Yang, Mu, Tang, Choon Yik
openaire +2 more sources
Applicable Analysis and Discrete Mathematics, 2021 This paper computes eigenvalues of discrete complete hypergraphs and partitioned hypergraphs. We define positive equivalence relation on hypergraphs that establishes a connection between hypergraphs and graphs. With this regards it makes a connection between spectrum of graphs and spectrum of quotient of any hypergraphs.
Mohammad Hamidi, Arsham Saeid
openaire +2 more sources
Spectrum of Gallai Graph of Some Graphs
Indian Journal of Pure and Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palathingal, Jeepamol J. +2 more
openaire +2 more sources
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +1 more source