2-3 graphs which have Vizing's adjacency property (Q1821113)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-3 graphs which have Vizing's adjacency property |
scientific article; zbMATH DE number 3997830 |
Statements
2-3 graphs which have Vizing's adjacency property (English)
0 references
1986
0 references
Let G denote a simple connected graph with number of vertices v, number of edges e and maximum vertex degree h, respectively. It is shown that each vertex in G is adjacent to at least two vertices of degree 3 iff the number of vertices of which are adjacent to vertices degree h only is equal to 6e-8v.
0 references
adjacency property
0 references
Vizing
0 references
0.7490192651748657
0 references
0.7477279901504517
0 references
0.745449423789978
0 references
0.745449423789978
0 references
