Recent questions and answers in Graph Theory

0 votes

0 answers

1

Graph Theory(Eular walk)
$A)$ If a graph has closed Eularian walk, then it has an even number of edges $B)$ If $G$ be a simple graph on $9$ vertices and the sum of all degrees in $G$ is atleast $27$, then $G$ has a vertex of degree atleast $4$. Which Statement should be true? Is it possible B) to be true? And for A) I think "only if" is needed in place of "if" to be true

asked 10 hours ago in Graph Theory by srestha Veteran (101k points) | 25 views

0 votes

0 answers

2

Connected Components

asked 2 days ago in Graph Theory by Na462 Loyal (6.9k points) | 53 views

+19 votes

5 answers

3

GATE2014-2-51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.

answered 5 days ago in Graph Theory by Nirmalbbll (61 points) | 2.7k views

0 votes

0 answers

4

Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?

asked Nov 6 in Graph Theory by dan31 (183 points) | 79 views

0 votes

0 answers

5

Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?

asked Nov 6 in Graph Theory by dan31 (183 points) | 31 views

0 votes

0 answers

6

Regular Graph
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4

asked Nov 6 in Graph Theory by dan31 (183 points) | 38 views

0 votes

0 answers

7

Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?

asked Nov 6 in Graph Theory by dan31 (183 points) | 113 views

+5 votes

3 answers

8

How to find no of paths of length 2 in the below graph ?

answered Nov 6 in Graph Theory by Mk Utkarsh Boss (23.1k points) | 395 views

+4 votes

0 answers

9

Spanning Tree
Calculate the number of Spanning trees possible for each of these graphs

asked Nov 5 in Graph Theory by Balaji Jegan Active (3.1k points) | 187 views

0 votes

0 answers

10

discrete maths

asked Nov 5 in Graph Theory by Lone Wolf Active (1.1k points) | 32 views

0 votes

0 answers

11

SELF DOUBT
lots of doubt in standard walk , trail , path definitions . some approach questions with different definitions others different approach . what is the standard definition for them

asked Oct 31 in Graph Theory by Deepanshu Active (4.3k points) | 23 views

0 votes

0 answers

12

made easy
ACCORDING TO ME , ANSWER SHOULD BE 1!!

asked Oct 31 in Graph Theory by Gate Fever Active (2.2k points) | 30 views

0 votes

1 answer

13

Test Series

answered Oct 30 in Graph Theory by Shaik Masthan Boss (35.9k points) | 78 views

0 votes

0 answers

14

Gateforum Test Series

asked Oct 29 in Graph Theory by Gupta731 Active (1.5k points) | 34 views

0 votes

1 answer

15

testbook Testseries
An organism is born on day k = 1 with 1 cells. During day k = 2, 3, . . . the organism produces k 2 k−1 times more new cells than it produced on day k − 1. Give a simplified expression for the total of all its cells after n days

answered Oct 28 in Graph Theory by goxul Active (4.1k points) | 36 views

0 votes

1 answer

16

NIELIT2017 STA-set-c-119
The function $f(x)=\frac{x^2 -1}{x-1}$ at $x=1$ is: (A) Continuous and Differentiable (B) Continuous but not Differentiable (C) Differentiable but not Continuous (D) Neither Continuous nor Differentiable

answered Oct 28 in Graph Theory by habedo007 Active (2.2k points) | 64 views

+4 votes

2 answers

17

CMI2013-B-02
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on 10 vertices. Let $u, \: v, \: w$ be three distinct vertices in $G$. How many simple paths are there from $u$ to $v$ going through $w$?

answered Oct 27 in Graph Theory by Dharmendra Lodhi Active (2.6k points) | 270 views

0 votes

0 answers

18

Graph Theory
what is Cyclomatic complexity? what is cyclomatic complexity of tree?

asked Oct 26 in Graph Theory by Priyanka17 Active (1.1k points) | 24 views

0 votes

0 answers

19

Graph theory
explain with example

asked Oct 26 in Graph Theory by Deepalitrapti Junior (967 points) | 56 views

0 votes

0 answers

20

Test series

asked Oct 26 in Graph Theory by Deepalitrapti Junior (967 points) | 18 views

+1 vote

1 answer

21

UGCNET-Jan2017-II-5
Consider a Hamiltonian Graph G with no loops or parallel edges and with $|V(G)| = n ≥ 3$. Then which of the following is true ? (1) $deg(v) ≥ \frac{n}{2}$ for each vertex v. (2) $|E(G)| ≥ \frac{1}{2}(n – 1) (n – 2) + 2$ (3) $deg (v) + deg(w) ≥ n$ whenever v and w are not connected by an edge. (4) All of the above

answered Oct 25 in Graph Theory by Aakash_ Active (1.5k points) | 135 views

+1 vote

0 answers

22

Graph theory

asked Oct 25 in Graph Theory by Deepalitrapti Junior (967 points) | 81 views

0 votes

0 answers

23

TANCET 2017 ALGORITHMS
[closed]

asked Oct 24 in Graph Theory by Balaji Jegan Active (3.1k points) | 12 views

0 votes

0 answers

24

TANCET 2017 ADJACENCY MATRIX

asked Oct 24 in Graph Theory by Balaji Jegan Active (3.1k points) | 7 views

0 votes

0 answers

25

TANCET 2017 GRAPH THEORY

asked Oct 24 in Graph Theory by Balaji Jegan Active (3.1k points) | 15 views

0 votes

0 answers

26

TANCET 2017 DIGRAPH

asked Oct 24 in Graph Theory by Balaji Jegan Active (3.1k points) | 17 views

0 votes

0 answers

27

TANCET 2017 TREE

asked Oct 24 in Graph Theory by Balaji Jegan Active (3.1k points) | 11 views

0 votes

0 answers

28

TANCET 2016 Tree

asked Oct 23 in Graph Theory by Balaji Jegan Active (3.1k points) | 20 views

0 votes

0 answers

29

TANCET 2016 Simple Graph

asked Oct 23 in Graph Theory by Balaji Jegan Active (3.1k points) | 23 views

0 votes

0 answers

30

TANCET 2016 GRAPH THEORY

asked Oct 23 in Graph Theory by Balaji Jegan Active (3.1k points) | 22 views

0 votes

1 answer

31

self doubt
every complete lattice is bounded lattice but not vice-versa . show with example thanks in advance

answered Oct 23 in Graph Theory by Magma Loyal (9.4k points) | 26 views

0 votes

0 answers

32

Graph theory

asked Oct 23 in Graph Theory by Deepalitrapti Junior (967 points) | 30 views

0 votes

0 answers

33

Graph theory

asked Oct 23 in Graph Theory by Deepalitrapti Junior (967 points) | 21 views

+1 vote

0 answers

34

graph theory(basic doubt)
Q.1)How many nonisomorphic simple graph are there with 6 vertices and 4 edges??

asked Oct 23 in Graph Theory by BASANT KUMAR Active (2.2k points) | 29 views

0 votes

0 answers

35

Planar Graph
Can minimum degree of a planar graph be $5$? Give some example

asked Oct 23 in Graph Theory by srestha Veteran (101k points) | 69 views

0 votes

1 answer

36

Strongly connected component
How to find Strongly connected components and weakly connected components in the given graph?

answered Oct 21 in Graph Theory by kd..... (377 points) | 56 views

0 votes

0 answers

37

Eulerian circuit
How many Eulerian graphs are possible?

asked Oct 21 in Graph Theory by Lakshman Patel RJIT Boss (14.1k points) | 67 views

0 votes

1 answer

38

Graph theory
How many numbers of Articulation Points (or Cut Vertices) in a Graph are possible?

answered Oct 21 in Graph Theory by garvit_vijai (113 points) | 29 views

0 votes

1 answer

39

graph theory(basic doubt,kenneth rosen)
Q.1) for which value of n are these graph are bipartite?? a)$C_{N}$ (cycle graph having "n" vertices) (b) $W_{N}$ (wheel graph having "n" vertices)

answered Oct 21 in Graph Theory by Soumya Tiwari Active (1.2k points) | 39 views

+21 votes

5 answers

40

TIFR2017-B-12
An undirected graph is complete if there is an edge between every pair of vertices. Given a complete undirected graph on $n$ vertices, in how many ways can you choose a direction for the edges so that there are no directed cycles? $n$ $\frac{n(n-1)}{2}$ $n!$ $2^n$ $2^m, \: \text{ where } m=\frac{n(n-1)}{2}$

answered Oct 17 in Graph Theory by Forrest Gump (79 points) | 1.2k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions and answers in Graph Theory

Recent Posts

Recent Blog Comments