On some algorithmic investigations of star partitions of graphs

DOI10.1016/0166-218X(94)00149-8zbMATH Open0838.05079OpenAlexW2063596425MaRDI QIDQ1900141FDOQ1900141

Slobodan K. Simić, P. Rowlinson, Dragoš 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

Recommendations

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

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)

Cites Work

• Matching theory
• Title not available (Why is that?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Recent results in the theory of graph spectra
• TWO THEOREMS IN GRAPH THEORY
• Matroid Intersection
• A study of eigenspaces of graphs
• The symbiotic relationship of combinatorics and matrix theory
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Dominating Sets and Eigenvalues of Graphs
• Star partitions and the graph isomorphism problem
• Title not available (Why is that?)
• 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)