Data Structures Algorithms-II MCQs

Page No. 79

What is a chromatic index?


aThe maximum number of colors required for proper edge coloring of graph

✖


bThe maximum number of colors required for proper vertex coloring of graph

✖


cThe minimum number of colors required for proper vertex coloring of graph

✖


dThe minimum number of colors required for proper edge coloring of graph

✓



The number of colors used by a proper edge coloring graph is called?


ak edge coloring graph

✓


bx edge coloring graph

✖


cm edge coloring graph

✖


dn edge coloring graph

✖


View Answer k edge coloring graph

What is the condition for proper edge coloring of a graph?


aTwo vertices having a common edge should not have same color

✖


bTwo vertices having a common edge should always have same color

✖


cNo two incident edges should have the same color

✓


dNo two incident edges should have different color

✖



In graph theory collection of dots and lines is called


avertex

✖


bedge

✖


cgraph

✓


dmap

✖


View Answer graph

A graph is found to be 2 colorable. What can be said about that graph?


aThe given graph is eulerian

✖


bThe given graph is bipartite

✓


cThe given graph is hamiltonian

✖


dThe given graph is planar

✖



Can there exist a graph which is both eulerian and is bipartite?


aYes

✓


bNo

✖


cYes if it has even number of edges

✖


dNothing can be said

✖


View Answer Yes

Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?


aYes

✓


bNo

✖


ceither A. or (b)

✖


d None of these

✖


View Answer Yes

A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)


a100

✓


b140

✖


c80

✖


d20

✖


View Answer 100

Are trees bipartite?


aYes

✓


bNo

✖


cYes if it has even number of vertices

✖


dNo if it has odd number of vertices

✖


View Answer Yes

When is a graph said to be bipartite?


aIf it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B

✓


bf the graph is connected and it has odd number of vertices

✖


cIf the graph is disconnected

✖


dIf the graph has at least n/2 vertices whose degree is greater than n/2

✖



Goto Page No.

Page 79 of 149

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan