The walk partition and colorations of a graph

DOI10.1016/0024-3795(82)90104-5MaRDI QIDQ1172071zbMATH OpenOpenAlexWikidataFDO

Authors David L. Powers, Mohammad M. Sulaiman

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0024-3795(82)90104-5

zbMATH Keywords

equitable partitionspectrumwalk partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 3556153 (Why is no real title available?)
• scientific article; zbMATH DE number 3407711 (Why is no real title available?)
• Pseudosimilar vertices in a graph
• The spectral approach to determining the number of walks in a graph

Cited in

(22)

• Landscapes and their correlation functions
• The cost of segregation in (social) networks
• Some results on graph spectra
• The H-join of arbitrary families of graphs -- the universal adjacency spectrum
• Some new aspects of main eigenvalues of graphs
• Main Q-eigenvalues and generalized Q-cospectrality of graphs
• The main eigenvalues and number of walks in self-complementary graphs
• On the Characteristic Equations of the Characteristic Polynomial
• Harary spectrum of generalized composition of graphs and Harary equienergetic graphs
• Equienergetic graphs using Cartesian product and generalized composition
• scientific article; zbMATH DE number 7090165
• Canonization of a random circulant graph by counting walks
• On a hierarchy of spectral isomorphism invariants
• On a hierarchy of spectral invariants for graphs
• Graphs with exactly three main eigenvalues
• The walks and CDC of graphs with the same main eigenspace
• Quotients of graph operators by symmetry representations
• Strategic timing of disclosure in belief formation
• Laplacian eigenvectors and eigenvalues and almost equitable partitions
• Spectral results on graphs with regularity constraints
• Spectral results on regular graphs with (k,)-regular sets
• Main eigenvalues and \((\kappa ,\tau )\)-regular sets

This page was built for publication: The walk partition and colorations of a graph

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