A characterization and an application of weight-regular partitions of graphs
type: Item
instance of: scholarly article
title: A characterization and an application of weight-regular partitions of graphs
zbMATH Open document ID: 1411.05213
author: Aida Abiad
published in: Linear Algebra and its Applications
publication date: 2019-05-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1807.07809
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7060508
zbMATH Keywords: weight-regular partition
zbMATH Keywords: Hoffman polynomial
zbMATH Keywords: chromatic number
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2910467595
arXiv ID: 1807.07809
cites work: Algebraic characterizations of regularity properties in bipartite graphs
cites work: Proof of a conjectured lower bound on the chromatic number of a graph
cites work: On 3-chromatic distance-regular graphs
cites work: Q3879234
cites work: Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
cites work: Q3907599
cites work: An inertial lower bound for the chromatic number of a graph
cites work: On the algebraic theory of pseudo-distance-regularity around a set
cites work: Eigenvalue interlacing and weight parameters of graphs
cites work: Algebraic characterizations of distance-regular graphs
cites work: Locally pseudo-distance-regular graphs
cites work: Compact graphs and equitable partitions
cites work: Interlacing eigenvalues and graphs
cites work: On the Polynomial of a Graph
cites work: Q5625207
cites work: A spectral excess theorem for nonregular graphs
cites work: New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
DOI: 10.1016/J.LAA.2019.01.011
description: scientific article