Unigraph Composition Tool
Configure two graphs below and compute their composition:
This toolkit provides a comprehensive suite for working with Tyshkevich decomposition and unigraph composition. Tyshkevich decomposition is a method for decomposing a graph into indecomposable components. Unigraph composition is a method for composing two or more graphs into a single graph.
We recommend reading the accompanying paper before interacting with this tool to fully understand the underlying concepts and algorithms. The paper is available at add paper link here.
Compose two graphs by their degree sequences. The second graph must be a split graph. Enter degree sequences in the format: degree^count (e.g., "5^2, 4^3, 1^1" represents 2 vertices of degree 5, 3 vertices of degree 4, and 1 vertex of degree 1). The composition operation is described in the key concepts section.
Compute the composition of two unigraphs. Configure two graphs using various graph types (C₅, mK₂, U2, U3, split graphs, etc.) and their parameters, then compute their composition. You can also apply transformations (inverse, complement, complement of inverse) to each graph before composing them. The composition operation is described in the key concepts section.
Generate random unigraphs with specified properties. Choose the number of vertices and the number of basic components, and the tool will generate random unigraph components and compose them into a final result. The composition operation is described in the key concepts section.
Decompose a graph (provided as a degree sequence) into its basic components. The tool will determine if the graph is a unigraph and show the full decomposition into components. The decomposition operation is described in the key concepts section.
Similar to the decomposition tool, but also computes the distinguishing number and fixing number for the graph. The tool provides the compacted version of the decomposition and the distinguishing number and fixing number of each component. The decomposition operation is described in the key concepts section.
Decompose a graph (provided as a degree sequence) into its basic components and compute fundamental graph properties: clique size, independence number, vertex cover number, and chromatic number. The tool determines if the graph is a unigraph and calculates these key structural characteristics. The decomposition operation is described in the key concepts section.
Choose a tool from the tabs above to begin working with unigraphs. Each tool provides interactive controls and displays results in real-time.
Configure two graphs below and compute their composition:
This tool computes the composition of two unigraphs to create a new graph.
How to use:
Generate random unigraphs with specific properties for testing and exploration.
How to use:
The tool will randomly partition the vertices across the components, then generate valid unigraph types with appropriate parameters for each component. Finally, it composes all components to produce the final random unigraph.
Each component's type, parameters, and degree sequence will be displayed, along with the final composed result.
Decompose a graph into its basic components:
Analyze a graph to determine if it's a unigraph and decompose it into basic components.
How to use:
The tool will:
This is useful for understanding the structure of complex graphs and verifying unigraph properties.
Decompose a graph into its basic components (with distinguishing number, fixing number, and compact version):
Decompose graphs and compute distinguishing and fixing numbers.
How to use:
The tool provides:
This advanced analysis is useful for research and detailed graph property verification.
Decompose a graph into its basic components:
Decompose graphs and compute clique size, independence number, vertex cover number, and chromatic number.
How to use:
The tool provides:
This analysis is useful for understanding fundamental graph properties and verifying structural characteristics.
Compose a graph by degree sequence:
Compose multiple graphs directly by their degree sequences.
How to use:
This tool is useful for applying the same composition operation to graphs regardless of if they're unigraphs. Graphs are composed sequentially from left to right: G0 ∘ G1 ∘ G2 ∘ ...
Note: All graphs after the first must be valid split graphs for the composition to work.