A characterization of weight-regular partitions of graphs

DOI10.1016/J.ENDM.2018.06.050MaRDI QIDQ1792117zbMATH OpenOpenAlexFDO

Authors Aida Abiad

Publication date 11 October 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.06.050

zbMATH Keywords

polynomialregular partitiondouble stochastic matrixweight-regular partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A characterization and an application of weight-regular partitions of graphs
• Characterizing and computing weight-equitable partitions of graphs
• Regular partitions of (weak) finite generalized polygons
• Star partitions and regularity in graphs
• Internal partitions of regular graphs

Cites work

• scientific article; zbMATH DE number 3683587 (Why is no real title available?)
• Algebraic characterizations of regularity properties in bipartite graphs
• Eigenvalue interlacing and weight parameters of graphs
• Interlacing eigenvalues and graphs
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II
• On the Polynomial of a Graph
• On the algebraic theory of pseudo-distance-regularity around a set

Cited in

(5)

• scientific article; zbMATH DE number 5720912 (Why is no real title available?)
• scientific article; zbMATH DE number 7593752 (Why is no real title available?)
• Characterizing and computing weight-equitable partitions of graphs
• A characterization and an application of weight-regular partitions of graphs
• scientific article; zbMATH DE number 2154974 (Why is no real title available?)

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

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