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

DOI10.1016/J.LAA.2015.08.015zbMATH Open1327.05166arXiv1405.5015OpenAlexW1183888138MaRDI QIDQ498316FDOQ498316

Authors: Jingfen Lan, Lingsheng Shi 

Publication date: 28 September 2015

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

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$.

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

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

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)

Cites Work

• Title not available (Why is that?)
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic results on the spectral radius and the diameter of graphs
• The minimal spectral radius of graphs with a given diameter
• Graphs with diameter \(n - e\) minimizing the spectral radius
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• Title not available (Why is that?)
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Title not available (Why is that?)

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)