Results 51 to 60 of about 121 (97)

Developments on Spectral Characterizations of Graphs

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

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

, 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, Minjie Zhang, Li, Shuchao, Shuchao Li   +3 more
core   +1 more source

On the eigenvalues of the distance signless Laplacian matrix of graphs

Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn.
Shooshtari, Hajar, Jahanbani, Akbar, Haq, Mohd Abrar Ul, Pirzada, Shariefuddin   +3 more
core   +1 more source

Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]

Int J Quantum Chem, 2023
Rauf A, Naeem M, Hanif A.
europepmc   +1 more source

Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]

Front Chem, 2023
Munir MM, Wusqa UT.
europepmc   +1 more source

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

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, Shariefuddin Pirzada, Francesco Belardo, Khan, Saleem, Pirzada, Shariefuddin, Belardo, Francesco   +5 more
core   +1 more source

Graph functions maximized on a path

, 2015
Given a connected graph G of order n and a nonnegative symmetric matrix A=[ai,j] of order n, define the function FA(G) as FA(G)=Σ1≤iG(i,j)ai,j, where dG(i,j) denotes the distance between the vertices i and j in G. In this note it is shown that FA(G)≤FA(P)
Nikiforov, Vladimir, Marques Da Silva, Celso   +1 more
core   +1 more source

Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs

, 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, Baghipur, Maryam, Alhevaz, Abdollah   +2 more
core  

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

, 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

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

Let $G=(V(G),E(G))$ be a simple graph, where $V(G)$ and $E(G)$ are the vertex set and the edge set of $G$, respectively. The number of components of $G$ is denoted by $c(G)$. Let $t$ be a positive real number, and a connected graph $G$ is $t$-tough if $t c(G-S)\leq|S|$ for every vertex cut $S$ of $V(G)$.
Liu, Xiangge, Lu, Yong, Jia, Caili, Zhou, Qiannan, Cui, Yue   +4 more
openaire   +2 more sources