Results 51 to 60 of about 120 (101)

Developments on Spectral Characterizations of Graphs

open access: yes
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core   +2 more sources

Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs

open access: yes, 2019
‎In this paper‎, ‎we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and‎ ‎obtain some bounds for the maximum‎ ‎eigenvalue of this matrix‎.
Ramane, ‎Harishchandra   +2 more
core  

Eigenvalue-based entropy in directed complex networks. [PDF]

open access: yesPLoS One, 2021
Sun Y, Zhao H, Liang J, Ma X.
europepmc   +1 more source

Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

open access: yes, 2011
Let G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(G). Also let D(G) be the distance matrix of a graph G (Janežič et al., 2007) [13].
Das, Kinkar Ch., Kinkar Ch. Das
core   +1 more source

On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number

open access: yes
For a connected graph $G$ of order $n$, let \( \mathcal {D}(G) \) be the distance matrix and $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$.
Saleem Khan   +5 more
core   +1 more source

Extremal properties of distance-based graph invariants for $k$-trees [PDF]

open access: yes, 2017
summary:Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Zhang, Minjie   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy