Results 101 to 110 of about 33,403 (178)

Matching, odd $[1,b]$-factor and distance spectral radius of graphs with given some parameters

open access: yes
Let $\mu(G)$ denote the the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by $\alpha(G)$.
Xi, Weige, Xu, Zengzhao
core  

Maximizing the Hamming Spectral Radius in Graphs [PDF]

open access: yesElectronic Journal of Mathematics
Zikai Tang, Binlian Li
doaj   +1 more source

Home - About - Disclaimer - Privacy