The clique number of the exact distance t-power graph: complexity and eigenvalue bounds

DOI10.1016/J.DAM.2024.11.032MaRDI QIDQ6671386zbMATH OpenFDO

Authors Aida Abiad, Afrouz Jabal Ameli, Luuk Reijnders

Publication date 27 January 2025

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

zbMATH Keywords

complexityclique numbereigenvalue boundsexact distance graph power

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Other types of codes (94B60)

Recommendations

• t-strong cliques and the degree-diameter problem
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• On the eigenvalues of distance powers of circuits
• Clique number and distance spectral radii of graphs.
• \(t\)-strong cliques and the degree-diameter problem

Cites work

• scientific article; zbMATH DE number 3834025 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• A theorem on equidistant codes
• About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
• Algorithms for Square Roots of Graphs
• Chromatic numbers of exact distance graphs
• Coding for Errors and Erasures in Random Network Coding
• Colouring exact distance graphs of chordal graphs
• Disconnected vertex sets and equidistant code pairs
• Eigenvalue bounds for sum-rank-metric codes
• Equidistant codes in the Grassmannian
• Exact distance graphs of product graphs
• Exact square coloring of subcubic planar graphs
• Hoffman's ratio bound
• Interlacing eigenvalues and graphs
• Linear degree extractors and the inapproximability of max clique and chromatic number
• On the \(k\)-independence number of graphs
• On the construction of q-ary equidistant codes
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• Self 2-distance graphs
• Sparsity. Graphs, structures, and algorithms
• Split Graphs Having Dilworth Number Two
• The optimal bound on the 3-independence number obtainable from a polynomial-type method
• The splittance of a graph

This page was built for publication: The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds

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