Results 41 to 50 of about 517 (82)

The domination number and the least $Q$-eigenvalue [PDF]

open access: yes, 2013
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang   +3 more
core  

Laplacian Distribution and Domination [PDF]

open access: yes, 2016
Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $\gamma(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq \gamma(G)$, and show that isolate-free graphs also satisfy $\gamma(G) \
Cardoso, Domingos M.   +2 more
core   +2 more sources

Laplacian spectral characterization of roses

open access: yes, 2017
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. Huang,
Belardo   +15 more
core   +2 more sources

Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]

open access: yesDiscrete Mathematics Letters, 2022
Saleem Khan, Shariefuddin Pirzada
doaj   +1 more source

Novel descriptors for the prediction of molecular properties

open access: yesOpen Chemistry
Molecular descriptors are fundamental to the fields of cheminformatics, drug discovery, and materials science, serving as quantitative representations of molecular structures that facilitate the prediction of various properties and activities.
Nizami Abdul Rauf   +3 more
doaj   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core   +1 more source

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

Home - About - Disclaimer - Privacy