Results 81 to 90 of about 272 (159)
A Laplacian eigenbasis for threshold graphs
Special MatricesLet GG be a graph on nn vertices. In this article, we prove that an eigenbasis of the Laplacian matrix of a star graph of order nn is also an eigenbasis of GG if and only if GG is a threshold graph. As an application of this spectral characterization, we
Macharete Rafael R. +3 more
doaj +1 more source
On applications of Andrica-Badea and Nagy inequalities in spectral graph theory
, 2015 Applications of Andrica-Badea and Nagy inequalities for determining bounds of graph invariants of undirected, connected graphs are investigated. We consider bounds of the following invariants: the first Zagreb index, general Randic index, Laplacian ...
MILOVANOVIĆ, Igor +2 more
core
Biclique Decompositions and Hermitian Rank
, 1999 The Hermitian rank, h(A), of a Hermitian matrix A is defined and shown to equal maxfn+ (A); n \Gamma (A)g, the maximum of the numbers of positive and negative eigenvalues of A.
Valerie L. Watts +6 more
core +1 more source
The Maximum Order of Adjacency Matrices With a Given Rank
AMS Subject Classification: 05B20, 05C50.Graph;Adjacency ...
Peeters, M.J.P., Haemers, W.H.
core
, 2008 We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and leads to a new tool to analyze them.
Jerzy Kocik
core
A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems. [PDF]
J Nonlinear Sci, 2023 Müller S.
europepmc +1 more source
Enumeration of Cospectral Graphs
AMS classification: 05C50;graphs;eigenvalues ...
Spence, E., Haemers, W.H.
core
Long cycles in 3-connected graphs in orientable surfaces
, 2002 In this paper we apply a cutting theorem of Thomassen to show that there is a function f: N → N such that if G is a 3-connected graph which can be embedded in the orientable surface of genus g with face-width at least f(g), then G contains a cycle of ...
Xingxing Yu
core
On strongly regular graphs with m2 = qm3 and m3 = qm2 [PDF]
, 2011 2010 Mathematics Subject Classification: 05C50.We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent ...
Lepovic, Mirko
core
Note on the product of the largest and the smallest eigenvalue of a graph
Special MatricesIn this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
Abiad Aida +2 more
doaj +1 more source