Improved McClelland and Koolen-Moulton bounds for distance energy of a graph. [PDF]
J Inequal Appl, 2018 Sridhara G +3 more
europepmc +1 more source
Factorization norms and an inverse theorem for MaxCut. [PDF]
Math AnnBalla I, Hambardzumyan L, Tomon I.
europepmc +1 more source
On adjacency operators of locally finite graphs
A graph Γ is called locally finite if, for each vertex v ∈ Γ, the set Γ(v) of its adjacent vertices is finite. For an arbitrary locally finite graph Γ with vertex set V (Γ) and an arbitrary field F, let FV(Γ) be the vector space over F of all functions V
Trofimov, V. I.
core +1 more source
Spectral norm and energy of a digraph with respect to a VDB topological index. [PDF]
HeliyonEspinal C, Monsalve J, Rada J.
europepmc +1 more source
On comparison between the distance energies of a connected graph. [PDF]
HeliyonGanie HA, Rather BA, Shang Y.
europepmc +1 more source
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree. [PDF]
J Inequal Appl, 2017 Guo SG, Zhang R.
europepmc +1 more source
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application. [PDF]
J Inequal Appl, 2017 He J, Liu YM, Tian JK, Liu XH.
europepmc +1 more source
NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH. [PDF]
Math Comput, 2020 Linderman GC, Steinerberger S.
europepmc +1 more source
The Spread of the Spectrum of a Graph
, 2007 Upper and lower bounds are obtained for the spread 1 \Gamma n of the eigenvalues 1 2 \Delta \Delta \Delta n of the adjacency matrix of a simple graph.
Daniel Hershkowitz +3 more
core
A Stochastic Approach to Generalized Modularity Based Community Detection. [PDF]
Entropy (Basel)Tipton J, Langston J.
europepmc +1 more source