Transformations of cubic graphs (Q1925057): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ioan Tomescu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ioan Tomescu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0016-0032(96)00015-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1980208823 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. I. Excluding a forest / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Proof of 4-Coloring the Edges of a Cubic Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5528475 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of a planar cubic graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3727001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Möbius Ladders / rank | |||
Normal rank |
Latest revision as of 14:26, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transformations of cubic graphs |
scientific article |
Statements
Transformations of cubic graphs (English)
0 references
7 April 1997
0 references
For a cubic graph, an edge-reduction, edge-expansion and three transformations (S-, X-, and H-transformations) are defined which preserve regularity. Some relations between them are discussed and it is proved that for any two connected cubic graphs with the same order one can be obtained from the other by a finite sequence of S-transformations. This implies that if for any two connected cubic graphs \(G\) and \(H\), \(d(G,H)\) denotes the minimum number of edge-reductions and/or edge-expansions from \(G\) to \(H\), then \(d\) defines a metric on the set of all connected cubic graphs.
0 references
cubic graph
0 references
edge-reduction
0 references
edge-expansion
0 references
transformations
0 references
metric
0 references