Graphs of order n and diameter 2(n-1)/3 minimizing the spectral radius

DOI10.1016/J.LAA.2015.08.015MaRDI QIDQ498316zbMATH OpenOpenAlexFDO

Authors Jingfen Lan, Lingsheng Shi

Publication date 28 September 2015

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.5015

zbMATH Keywords

spectral radiusdiametercharacteristic polynomialquipus

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Algebraic combinatorics (05E99) Applications of graph theory to circuits and networks (94C15)

Abstract: The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for $din1,2cup[n/2,2n/3-1]cupn-kmidk=1,2,\mathrm{...},8$. In this paper, we determine all minimizer graphs for $d=2(n-1)/3$.

Recommendations

• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Graphs with diameter \(n - e\) minimizing the spectral radius
• Spectral radius of graph with given diameter.
• A lower bound for the spectral radius of graphs with fixed diameter
• Maximizing the spectral radius of k-connected graphs with given diameter

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3465473 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 3794105 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Asymptotic results on the spectral radius and the diameter of graphs
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• Graphs with diameter \(n - e\) minimizing the spectral radius
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• The minimal spectral radius of graphs with a given diameter

Cited in

(9)

• A lower bound for the spectral radius of graphs with fixed diameter
• Quipu quivers and Nakayama algebras with almost separate relations
• On the divisibility of H-shape trees and their spectral determination
• Asymptotic results on the spectral radius and the diameter of graphs
• The minimal spectral radius of graphs with a given diameter
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Disproof of a conjecture on the minimum spectral radius and the domination number
• Graphs with diameter \(n - e\) minimizing the spectral radius

This page was built for publication: Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498316)