K4, as a plane graph, is self-dual.
False. The complete graph K4 is not self-dual as a plane graph. In graph theory, a graph is said to be self-dual if it is isomorphic to ________ ___ ___ _______ ____ ___.
__________ ____ __________ ______ ___ __________ _______ _____ ___ ___ _______ _________.
__________ _______ ____ _________ __________.
_______ _______ ____ ___ ________ __________ ___ ______.
_______ ________ __________ _____ _______ ______.
_____ _____ __________ ____ _______ ___ _________ ____ __________ ______ ________.
_________ ____ ________ ___ _________ ____ _________ _________ __________ _______ ___.
_________ _________ ______ ______ _____ __________ _______ _________ ___ _______.
__________ _____ ________ ________ ___ ______ _____.
__________ ___ ________ ___ _______.
Get Full Answer on WhatsApp
If κ(G) < κ0 (G), then δ(G) ≥ 4.
Draw a diagram, as nice as possible, of the line graph of the Petersen graph. Write the number of vertices, the number of edges, the minimum and maximum degrees of it.
Draw the dual of the following plane graph.
Does the dual have any cut-vertex? Justify.
For some nonnegative integers d1, d2, . . . , dn the sequence (max{d1, n}, d2, d3, . . . , dn) is graphic.
Let G be a graph having no isolated vertex and no induced subgraph with exactly two edges. Show that G is a complete graph.
For the graph given in Q. 3(b), find the number of (v2, v5)-walks of length 3.
The complement of a disconnected graph is connected.