On the spectral radius of graphs with a given domination number

By Dragan Stevanovic, Mustapha Aouchiche, Pierre Hansen. 2007

55 citations recorded by the source corpus.

We characterize the graphs which achieve the maximum value of the spectral radius of the adjacency matrix in the sets of all graphs with a given domination number and graphs with no isolated vertices and a given domination number.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/8a498f977cc3eb6ead9cb62ca7f82828f57b398b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Weijun Liu
2. Yongtao Li
3. Lihua Feng

In Geometry and Topology

1. Weijun Liu
2. Yongtao Li
3. Lihua Feng

Citations in the corpus

• A survey on spectral conditions for some extremal graph problems (2021, background): “This problem is well studied in the literature for many classes of graphs, such as graphs with cut vertices [11], given diameter [92], edge chromatic number [73], domination number [173].”