Vipul: Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed a '''cubic graph''' or '''trivalent graph''' if it is a 3-regular graph, i.e., every verte..."

2012-05-28T17:13:01Z

Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed a '''cubic graph''' or '''trivalent graph''' if it is a 3-regular graph, i.e., every verte..."

New page

{{undirected graph property}}

==Definition==

An [[undirected graph]] is termed a '''cubic graph''' or '''trivalent graph''' if it is a 3-[[regular graph]], i.e., every vertex of the graph has [[degree of a vertex|degree]] equal to three.

==Relation with other properties==

===Stronger properties===

{| class="sortable" border="1"
! Property !! Meaning !! Proof of implication !! Proof of strictness (reverse implication failure) !! Intermediate notions
|-
| [[Weaker than::bicubic graph]] || cubic bipartite graph || || ||
|}

===Weaker properties===

{| class="sortable" border="1"
! Property !! Meaning !! Proof of implication !! Proof of strictness (reverse implication failure) !! Intermediate notions
|-
| [[Stronger than::regular graph]] || || || ||
|}

Cubic graph - Revision history

Vipul: Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed a '''cubic graph''' or '''trivalent graph''' if it is a 3-regular graph, i.e., every verte..."