MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Discrete Mathematics
→
Inference
→
If the number of vertices of a chromatic polynomi...
1.
If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG?
A.
344
B.
73
C.
265
D.
56
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
A non-planar graph can have ____________
What is the number of edges of the greatest planar subgraph of K3,2 where m,n≤3?
Suppose G be a connected planar graph of order n≥5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true?
For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing a planar representation of the graph?
If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG?
Determine the density of a planar graph with 34 edges and 13 nodes.
If Cn is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(Cn).
If a graph G is k-colorable and k
The chromatic number of a graph is the property of ____________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies