On some algorithmic investigations of star partitions of graphs

DOI10.1016/0166-218X(94)00149-8MaRDI QIDQ1900141zbMATH OpenOpenAlexFDO

Authors P. Rowlinson, Dragoš Cvetković, Slobodan K. Simić

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

eigenvaluespartitionadjacency matrixspectral decompositioneigenspacespolynomial algorithmvertex setstar partitionstar basis

Mathematics Subject Classification ID

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

Recommendations

• Star partitions and regularity in graphs
• Star partitions and the graph isomorphism problem
• Eigenspaces of graphs

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3606506 (Why is no real title available?)
• scientific article; zbMATH DE number 510845 (Why is no real title available?)
• A study of eigenspaces of graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Matching theory
• Matroid Intersection
• Recent results in the theory of graph spectra
• TWO THEOREMS IN GRAPH THEORY
• The symbiotic relationship of combinatorics and matrix theory

Cited in

(5)

• Dominating Sets and Eigenvalues of Graphs
• Star partitions and the graph isomorphism problem
• scientific article; zbMATH DE number 7366808 (Why is no real title available?)
• On the isomorphism of graphs having some eigenvalues of moderate multiplicity
• Graphs for small multiprocessor interconnection networks

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

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