Results 161 to 170 of about 412,655 (203)
Spectral redemption in clustering sparse networks. [PDF]
Proc Natl Acad Sci U S A, 2013 Krzakala F +6 more
europepmc +1 more source
Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network. [PDF]
PLoS One, 2015 Palanisamy T, Krishnasamy KN.
europepmc +1 more source
Retinal Artery-Vein Classification via Topology Estimation. [PDF]
IEEE Trans Med Imaging, 2015 Estrada R +5 more
europepmc +1 more source
Collective consciousness and its pathologies: understanding the failure of AIDS control and treatment in the United States. [PDF]
Theor Biol Med Model, 2007 Wallace RM +3 more
europepmc +1 more source
On the multiplicity of Laplacian eigenvalues for unicyclic graphs [PDF]
Czechoslovak Mathematical Journal, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wen, Fei, Huang, Qiongxiang
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
On broadcasting in unicyclic graphs
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hovhannes A. Harutyunyan +1 more
openaire +1 more source
Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +2 more sources
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +2 more sources
THE GUTMAN INDEX OF UNICYCLIC GRAPHS
Discrete Mathematics, Algorithms and Applications, 2012Let G be a connected graph with vertex set V(G). The Gutman index of G is defined as S(G) = ∑{u, v}⊆V(G) d(u)d(v)d(u, v), where d(u) is the degree of vertex u, and d(u, v) denotes the distance between u and v. In this paper, we characterize n-vertex unicyclic graphs with girth k, having minimal Gutman index.
openaire +2 more sources