Results 11 to 20 of about 175,546 (265)
On the Grone-Merris conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Grone and Merris [GM94] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. We prove that this conjecture holds for a class of graphs including trees.
Tamon Stephen
doaj +1 more source
Distributed estimation of graph spectrum [PDF]
2015 American Control Conference (ACC), 2015 15 pages, 2 ...
Mu Yang, Choon Yik Tang
openaire +2 more sources
$Kite_{p+2,p}$ is determined by its Laplacian spectrum [PDF]
Transactions on Combinatorics, 2021 $Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $p\geq4$ to an endpoint of path graph with order $n-p$. It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H.
Hatice Topcu
doaj +1 more source
Spectrum knowledge graph: an intelligent engine facing future spectrum management
Tongxin xuebao, 2021 To solve the issues of simple representations on spectrum situation, much dependence on artificial experience in manual management and low efficiency and accuracy in the current spectrum management, meeting the requirements of automation, precision and ...
Jiachen SUN +4 more
doaj +2 more sources
On the spectrum of Wenger graphs
Journal of Combinatorial Theory, Series B, 2014 Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite sets $P$ and $L$ defined as follows: a point $(p)=(p_1,p_2,\ldots,p_{m+1})\in P$ is adjacent to a line $[l]=[l_1,l_2,
Sebastian M. Cioaba +2 more
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
On the Spectrum of the Derangement Graph [PDF]
The Electronic Journal of Combinatorics, 2007 We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
openaire +3 more sources
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
Discussiones Mathematicae Graph Theory, 2022 A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source
Tarantula graphs are determined by their Laplacian spectrum
Electronic Journal of Graph Theory and Applications, 2021 A graph G is said to be determined by its Laplacian spectrum (DLS) if every graph with the same Laplacian spectrum is isomorphic to G. A graph which is a collection of hexagons (lengths of these cycles can be different) all sharing precisely one vertex ...
Reza Sharafdini, Ali Zeydi Abdian
doaj +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source