Extremal unicyclic graphs with minimal distance spectral radius

Hongyan Lu; Jing Luo; Zhongxun Zhu

doi:10.7151/dmgt.1772

ScienceGate Book Chapters

JOURNAL ARTICLE

Extremal unicyclic graphs with minimal distance spectral radius

Hongyan Lu Jing Luo Zhongxun Zhu

Year: 2014 Journal: Discussiones Mathematicae Graph Theory Vol: 34 (4)Pages: 735-735 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.1772

Get Full-Text PDF Get Analytical Report

Abstract

The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3). In this paper, we determine the extremal unicyclic graph which has minimal distance spectral radius in U (n,m) \ Cn.

Keywords:

Combinatorics Mathematics RADIUS Spectral radius Geometry Physics Computer science Eigenvalues and eigenvectors Computer security Quantum mechanics

Metrics

Cited By

1.30

FWCI (Field Weighted Citation Impact)

Refs

0.80

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Extremal unicyclic graphs with minimal distance spectral radius

Abstract

Metrics

Citation History

Topics

Related Documents

Unicyclic graphs of minimal spectral radius

Unbalanced unicyclic and bicyclic graphs with extremal spectral radius

Extremal arithmetic–geometric spectral radius of unicyclic graphs

Distance spectral radius of unicyclic graphs with fixed maximum degree

Extremal distance spectral radius of graphs with fixed size