Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
R S BAGDA
asked
in
Graph Theory
Apr 27, 2022
147
views
0
votes
0
votes
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
graph-theory
R S BAGDA
asked
in
Graph Theory
Apr 27, 2022
by
R S BAGDA
147
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
According to Euler’s formula for planar graph,
$v-e+f = 2$
$23 – 30 + f = 2$
$f = 9$
Aditya_
answered
Apr 27, 2022
by
Aditya_
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
shivani2010
asked
in
Graph Theory
Jun 12, 2016
1,156
views
Graph having every pair of vertices connected is called
Graph having every pair of vertices connected is called Cycle graph Complete graph Peterson graph Is a Tree
shivani2010
asked
in
Graph Theory
Jun 12, 2016
by
shivani2010
1.2k
views
graph-theory
1
vote
1
vote
1
answer
2
Sahil Gupta
asked
in
Graph Theory
Dec 16, 2014
314
views
Prove that maximam number of edges in a planer graph with n vertices is 3n-6
Sahil Gupta
asked
in
Graph Theory
Dec 16, 2014
by
Sahil Gupta
314
views
1
vote
1
vote
1
answer
3
Akriti sood
asked
in
Graph Theory
Nov 28, 2016
1,429
views
The possible number of faces of simple graph G with degree sequence 3, 3, 3, 3, 3, 3, 6 ______
The possible number of faces of simple graph G with degree sequence 3, 3, 3, 3, 3, 3, 6 ______ 5,6 6,7
Akriti sood
asked
in
Graph Theory
Nov 28, 2016
by
Akriti sood
1.4k
views
graph-theory
engineering-mathematics
1
vote
1
vote
2
answers
4
shivani2010
asked
in
Graph Theory
Jun 12, 2016
2,896
views
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
shivani2010
asked
in
Graph Theory
Jun 12, 2016
by
shivani2010
2.9k
views
graph-theory
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Discrete Mathematics
(6.5k)
Mathematical Logic
(2.2k)
Set Theory & Algebra
(1.7k)
Combinatory
(1.5k)
Graph Theory
(993)
Probability
(1.2k)
Linear Algebra
(888)
Calculus
(714)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
