The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
type: Item
instance of: scholarly article
title: The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
zbMATH Open document ID: 0914.05050
DOI: 10.1016/S0166-218X(98)00050-X
author: E. Garriga
author: Miquel Angel Fiol
published in: Discrete Applied Mathematics
publication date: 1999-06-07T00:00:00Z
review text: The authors use \(k\)-alternating polynomials (introduced by the authors and \textit{J. L. A. Yebra} in [J. Comb. Theory, Ser. B 67, No. 1, 48-61, Art. No. 0033 (1996; Zbl 0857.05101)]) and the newly defined \(\tau\)-adjacency polynomials to obtain spectrally based inequalities for the diameter and some related invariants of a graph.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1218470
zbMATH Keywords: adjacency polynomials
zbMATH Keywords: spectra
zbMATH Keywords: alternating polynomials
zbMATH Keywords: inequalities
zbMATH Keywords: diameter
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Q5689821
cites work: Diameters and Eigenvalues
cites work: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
cites work: Upper bounds for eigenvalues of the discrete and continuous Laplace operators
cites work: Developments in the theory of graph spectra
cites work: Eigenspaces of graphs
cites work: Graphs with given diameter maximizing the spectral radius
cites work: Bounds on special subsets in graphs, eigenvalues and association schemes
cites work: Eigenvalues and the diameter of graphs
cites work: Diameter, covering index, covering radius and eigenvalues
cites work: Eigenvalues, eigenspaces and distances to subsets
cites work: Maximally connected digraphs
cites work: An eigenvalue characterization of antipodal distance-regular graphs
cites work: On a class of polynomials and its relation with the spectra and diameters of graphs
cites work: The alternating polynomials and their relation with the spectra and conditional diameters of graphs
cites work: Boundary graphs. II: The limit case of a spectral property
cites work: Locally pseudo-distance-regular graphs
cites work: Problems in algebraic combinatorics
cites work: Feasibility conditions for the existence of walk-regular graphs
cites work: On the Polynomial of a Graph
cites work: Isoperimetric Inequalities and Eigenvalues
cites work: Ramanujan graphs
cites work: Eigenvalues, diameter, and mean distance in graphs
cites work: Spectral diameter estimates for \(k\)-regular graphs
cites work: Q3999365
Wikidata QID: Q127674080
full work available at URL: s0166-218x(98)00050-x
OpenAlex ID: W2083720489
description: scientific article; zbMATH DE number 1218470