A characterization and an application of weight-regular partitions of graphs

DOI10.1016/j.laa.2019.01.011zbMath1411.05213arXiv1807.07809OpenAlexW2910467595MaRDI QIDQ2418982

Aida Abiad

Publication date: 29 May 2019

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

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

zbMATH Keywords

chromatic numberHoffman polynomialweight-regular partition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (1)

Characterizing and computing weight-equitable partitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• A spectral excess theorem for nonregular graphs
• An inertial lower bound for the chromatic number of a graph
• Compact graphs and equitable partitions
• Proof of a conjectured lower bound on the chromatic number of a graph
• Locally pseudo-distance-regular graphs
• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Eigenvalue interlacing and weight parameters of graphs
• Algebraic characterizations of distance-regular graphs
• Interlacing eigenvalues and graphs
• On 3-chromatic distance-regular graphs
• Algebraic characterizations of regularity properties in bipartite graphs
• On the Polynomial of a Graph
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: A characterization and an application of weight-regular partitions of graphs