Operator Decomposition of Graphs
Explore this paper's citation graph
Summary
An optimal algorithm for finding the 1-Decomposition of a graph which is a special case of the (P, Q)-decomposition which was first introduced in (21).
- Type
- article
- Published
- 2006-01-01
- Cited by
- 0
- References
- 20
- OpenAlex
- https://openalex.org/W48275593
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:11792865
Keywords
Modular decomposition, Decomposition, Disjoint sets, Operator (biology), Mathematics
References
- Graphs with no induced C4 and 2K2
- Graph Classes: A Survey
- P_4-laden Graphs: A New Class of Brittle Graphs
- Linear Recognition of Pseudo-split Graphs
- Class of graphs with restricted neighborhoods
- Once more on matrogenic graphs
- P-Components and the Homogeneous Decomposition of Graphs
- Decomposition of graphical sequences and unigraphs
- On the Decomposition of Graphs
- Split graphs
- ω-Perfect graphs
- Matroidal graphs
- Some classes of perfectly orderable graphs
- A New Linear Algorithm for Modular Decomposition
- Linear Separation of Dominating Sets in Graphs
Cited by
No citing papers recorded for this paper.
Related papers
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
- The Condition Number of Join Decompositions
- Green functions on self-similar graphs and bounds for the spectrum of the Laplacian
- Decompositions of the free product of Graphs
- The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
- DECOMPOSITION PRINCIPLE FOR THE RECIPROCAL OF THE FACTORIAL
- Operators and spaces associated to matrices with grades and their decompositions
- On the ideal of orthogonal representations of a graph in R2
- Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields