The walk partition and colorations of a graph

DOI10.1016/0024-3795(82)90104-5zbMath0501.05044OpenAlexW1971347998WikidataQ127526579 ScholiaQ127526579MaRDI QIDQ1172071

Mohammad M. Sulaiman, David L. Powers

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

spectrumequitable partitionwalk 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) Coloring of graphs and hypergraphs (05C15)

Related Items

Harary spectrum of generalized composition of graphs and Harary equienergetic graphs, The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum, The main eigenvalues and number of walks in self-complementary graphs, Unnamed Item, Laplacian eigenvectors and eigenvalues and almost equitable partitions, Spectral results on graphs with regularity constraints, Landscapes and their correlation functions, Spectral results on regular graphs with \((k,\tau)\)-regular sets, On the Characteristic Equations of the Characteristic Polynomial, The cost of segregation in (social) networks, Main eigenvalues and \((\kappa ,\tau )\)-regular sets, Some new aspects of main eigenvalues of graphs, Unnamed Item, Some results on graph spectra, Main Q-eigenvalues and generalized Q-cospectrality of graphs

Cites Work

• The spectral approach to determining the number of walks in a graph
• Pseudosimilar vertices in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item