An efficient method for decomposition of regular structures using graph products (Q5698787): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nme.1126 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971581675 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2757769 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4873761 / rank | |||
Normal rank | |||
Latest revision as of 16:48, 10 June 2024
scientific article; zbMATH DE number 2216628
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient method for decomposition of regular structures using graph products |
scientific article; zbMATH DE number 2216628 |
Statements
An efficient method for decomposition of regular structures using graph products (English)
0 references
20 October 2005
0 references
graphs
0 references
regular structures
0 references
strong Cartesian product
0 references
direct product
0 references
eigenvalues
0 references
adjacency
0 references
Laplacian
0 references
bisection
0 references
partitioning
0 references
