On some algorithmic investigations of star partitions of graphs

DOI10.1016/0166-218X(94)00149-8zbMath0838.05079OpenAlexW2063596425MaRDI QIDQ1900141

Peter Rowlinson, Slobodan K. Simic, Dragos Cvetković

Publication date: 30 May 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00149-8

zbMATH Keywords

partitioneigenvaluesadjacency matrixeigenspacesspectral decompositionpolynomial algorithmvertex setstar partitionstar basis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Graphs for small multiprocessor interconnection networks ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• The symbiotic relationship of combinatorics and matrix theory
• Recent results in the theory of graph spectra
• A study of eigenspaces of graphs
• Matroid Intersection
• TWO THEOREMS IN GRAPH THEORY
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: On some algorithmic investigations of star partitions of graphs