Extremal problems on distance spectra of graphs

DOI10.1016/J.DAM.2020.09.023MaRDI QIDQ2217468zbMATH OpenOpenAlexFDO

Authors Huiqiu Lin, Yuke Zhang

Publication date 29 December 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.09.023

zbMATH Keywords

distance spectral radiusHamilton cycleHamilton pathsum of eigenvalues

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Distance spectrum, 1-factor and vertex-disjoint cycles
• On the distance spectral radius of bipartite graphs
• Spectral radius and Hamiltonian properties of graphs. II
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
• Spectral radius of a balanced bipartite graph and its Hamiltonicity

Cites work

• A method in graph theory
• Bounds on graph eigenvalues. II
• Distance spectra of graphs: a survey
• Distance spectral radius of trees with fixed maximum degree
• On a problem of K. Zarankiewicz
• On Hamiltonian bipartite graphs
• On the least distance eigenvalue and its applications on the distance spread
• On the sum of k largest distance eigenvalues of graphs
• Proximity, remoteness and distance eigenvalues of a graph
• Remoteness and distance eigenvalues of a graph
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Spectral conditions for the existence of specified paths and cycles in graphs
• The distance spectrum of a tree
• The history of degenerate (bipartite) extremal graph problems
• The maximum spectral radius of C₄-free graphs of given order and size
• Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
• Wiener index, Harary index and graph properties
• Über ein Problem von K. Zarankiewicz

Cited in

(15)

• Distance spectrum, 1-factor and vertex-disjoint cycles
• A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Spectral extrema for graphs: the Zarankiewicz problem
• Distance problems within Helly graphs and \(k\)-Helly graphs
• Some extremal properties of the degree distance of a graph
• Extremal metrics on graphs. I
• Extremal problems for the p-spectral radius of graphs
• Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
• The sum of the \(k\) largest distance eigenvalues of graphs
• Extremal arithmetic-geometric spectral radius of unicyclic graphs
• Distance spectral radius and Hamiltonicity of a graph
• Distance spectral conditions for \textit{ID}-factor-criticality and fractional \([a,b]\)-factor of graphs
• Toughness, fractional extendability and distance spectral radius in graphs
• Fractional perfect matching and distance spectral radius in graphs

This page was built for publication: Extremal problems on distance spectra of graphs

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