Results 21 to 30 of about 169,163 (265)
Graph comparison via the nonbacktracking spectrum [PDF]
Physical Review E, 2019 The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however often these are not metrics (rendering standard data-mining techniques infeasible), or are computationally infeasible
Mellor, A, Grusovin, A
openaire +4 more sources
Journal of the London Mathematical Society, 2023 AbstractIn this paper, we prove sharp decay estimates of nonnegative generalized subharmonic functions on graphs with positive Laplacian spectrum, which extends the result by Li and Wang (J. Differential Geom. 58 (2001) 501–534) on Riemannian manifolds.
Hua, Bobo, Lu, Zhiqin
openaire +2 more sources
On one infinite series of admissible intersection arrays of distance-regular graphs of diameter 5
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. One generalization of one known infinite series of admissible intersection arrays of a bipartite antipodal distance-regular graph is proposed for consideration.
I.T. Mukhamet'yanov
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 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
Graph Theory: A Lost Component For Development in Nigeria
Journal of Nigerian Society of Physical Sciences, 2022 Graph theory is one of the neglected branches of mathematics in Nigeria but with the most applications in other fields of research. This article shows the paucity, importance, and necessity of graph theory in the development of Nigeria.
Olayiwola Babarinsa
doaj +1 more source
$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
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
On the Spectrum of Threshold Graphs [PDF]
ISRN Discrete Mathematics, 2011 The antiregular connected graph on r vertices is defined as the connected graph whose vertex degrees take the values of r−1 distinct positive integers. We explore the spectrum of its adjacency matrix and show common properties with those of connected threshold graphs, having an equitable partition with a minimal number r of parts.
Sciriha, Irene, Farrugia, Stephanie
openaire +2 more sources
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