3 views

Uploaded by Philip Mak

- Card Shuffling - Peter Luthy
- Modern Graph Theory (1)
- Small World
- Theory of Computation
- Fast and Simple Algorithms to Count the Number
- Lab12 Data Struct Programming
- Mobius Strips
- Errata Agnarsson Graph Theory
- MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), Volume 1 / 2015
- Discrete Math (Combinatorics)
- Graph
- Load Balancing
- lec not
- siamcse2011
- 3200induction.pdf
- 1
- VideoMiningBook_Chapter7.pdf
- Network Theory 3rd Semester Etc Bees2211
- Graph Coloring
- Teoria de Números

You are on page 1of 2

Assignment #3 Solutions

21 points

1. (4 points)

Let G be the graph defined by V (G) = {1, 2, 3, 4} and E(G) = {12, 13, 14}. Construct a

3-regular graph H such that G is an induced subgraph of H.

Ans. The complete bipartite graph K3,3 on vertex set {1, 2, ..., 6} with parts {2, 3, 4} and {1, 5, 6}

has G as its subgraph. We could alternatively use the theorem proved in class to build the

desired graph, however this would lead to a graph on 16 vertices.

2. (3 points)

What is the adjacency matrix of each of the following graphs:

C6 , the cycle of order 6.

K6 , the complete graph of order 6.

Ans .

0 1 0 0 0 0

1 0 1 0 0 0

0 1 0 1 0 0

AP 6 =

0 0 1 0 1 0

0 0 0 1 0 1

0 0 0 0 1 0

0 1 0 0 0 1

1 0 1 0 0 0

0 1 0 1 0 0

AC6 =

0 0 1 0 1 0

0 0 0 1 0 1

1 0 0 0 1 0

0 1 1 1 1 1

1 0 1 1 1 1

1 1 0 1 1 1

AK6 =

1 1 1 0 1 1

1 1 1 1 0 1

1 1 1 1 1 0

Let AG be the adjacency matrix of a graph G of order n. Prove that for every i, the

(i, j)th entry of AG Jn is equal to deg(i).

Prove that G is a regular graph if and only if AJ = JA.

Ans .

1

This is simply because the (i, j)th entry of AJ is equal to

n

X n

X

Ai,k Jk,j = Ai,k = deg(i).

k=1 k=1

Similar to the first part, one can show that the (i, j)th entry of JA is equal to deg(j).

Thus, if AJ = JA, then for every i and j, deg(i) = AJi,j = JAi,j = deg(j), implying

that G is a regular graph.

4. (5 points)

Let Km,n denote the bipartite graph on m + n vertices, with vertex set V = {u1 , . . . , um }

{v1 , . . . , vn } and edge set E = {ui vj |1 i m, 1 j n}. So, Km,n has size mn.

How many automorphisms does Kn,n have?

Ans .

Observe that when m 6= n for every i, j, deg(ui ) = n and deg(vj ) = m. So any auto-

morphism of Km,n in this case cannot map a vertex from {u1 , ..., um } to {v1 , . . . , vn }.

On the other hand any permutation of vertices within the two parts is allowed, as the

vertices are connected to all the vertices on the other part, and permuting them will not

change this fact. As the number of permutations of first part is m! and the second part

is n!, there are (m!) (n!) ways to combine these and obtain an automorphism of Km,n .

When m = n, namely Kn,n our argument from above does not go through and we might

be able to switch ui with vj . However, if a vertex from {u1 , ..., un } is mapped to one

from {v1 , ..., vn }, then the rest of the vertices of {u1 , ..., un } must also be mapped to

{v1 , ..., vn } also. As ui is not connected to any of {u1 , ..., un }. The number of ways to

make such automorphisms is 2(n!)2 . Namely, any automorphism of the type we made

in the part 1 of the problem, can be combined with a mirroring map from us to vs to

obtain another automorphism of Kn,n .

disconnected. Prove that every edge of a tree T is a bridge of it.

Ans. Assume for contradiction that T e is connected for some edge e of a tree T . This would

imply that T e is a tree on less than n 1 edges, contradicting a property of trees that we

showed in class. However, to prove it directly and only relying on the definition of a tree,

assuming T e is connected, where e = uv is an edge of the tree, implies that there must be

a uv path in T e. Adding e to this uv path gives a cycle in T , contradicting that T was a

tree.

- Card Shuffling - Peter LuthyUploaded byazurillmarill3734
- Modern Graph Theory (1)Uploaded byLêNhậtHoàng
- Small WorldUploaded byjasonbrogan
- Theory of ComputationUploaded byGede Pramudya
- Fast and Simple Algorithms to Count the NumberUploaded bydavidsmc
- Lab12 Data Struct ProgrammingUploaded byepy90
- Mobius StripsUploaded byjohnjabaraj
- Errata Agnarsson Graph TheoryUploaded byAnonymous IHf491d
- MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), Volume 1 / 2015Uploaded byAnonymous 0U9j6BLllB
- Discrete Math (Combinatorics)Uploaded bysal27adam
- GraphUploaded bywarezisgr8
- Load BalancingUploaded byLore
- lec notUploaded bystacy
- siamcse2011Uploaded byFlorenTina
- 3200induction.pdfUploaded byMandig Montilde John Ray
- 1Uploaded byAndres Garzon Valencia
- VideoMiningBook_Chapter7.pdfUploaded bySwathi Vishwanath
- Network Theory 3rd Semester Etc Bees2211Uploaded byAhsan Jamil
- Graph ColoringUploaded byRama Sugavanam
- Teoria de NúmerosUploaded byVictor
- My Seminar WorkUploaded byIbe Samuel C
- p226-leeUploaded bysarkpromaxx
- On Cubic Graceful LabelingUploaded byEditor IJRITCC
- Patterns in Randomly Evolving Networks - Idiotypic NetworksUploaded byFahad Ahmad Khan
- si508f11-week5.2Uploaded byheymka
- Angadi Institute of Technology and Management-convertedUploaded byABHISHEK YAKKUNDI
- 07 ReducedUploaded byTrần Sơn Chiến
- DirectedRandomGraphs FinalUploaded byLyrad Magpantay
- A Bound on the Scrambling Index of a Primitive Matrix Using Boolean RankUploaded byZuhri Muin
- Colloquium _ Prof. Richard KarpUploaded byNghĩa Nguyễn Tín

- 2017 LDP Summer Analysts RolesUploaded byPhilip Mak
- hw8-soln.pdfUploaded byPhilip Mak
- hw9-soln.pdfUploaded byPhilip Mak
- hw10-soln.pdfUploaded byPhilip Mak
- hw7-soln.pdfUploaded byPhilip Mak
- hw10.pdfUploaded byPhilip Mak
- hw9.pdfUploaded byPhilip Mak
- hw6-soln.pdfUploaded byPhilip Mak
- hw6.pdfUploaded byPhilip Mak
- hw5.pdfUploaded byPhilip Mak
- hw8.pdfUploaded byPhilip Mak
- hw7.pdfUploaded byPhilip Mak
- hw5-soln.pdfUploaded byPhilip Mak
- hw4-soln.pdfUploaded byPhilip Mak
- hw2-soln.pdfUploaded byPhilip Mak
- hw3.pdfUploaded byPhilip Mak
- hw1.pdfUploaded byPhilip Mak
- hw4.pdfUploaded byPhilip Mak
- hw2.pdfUploaded byPhilip Mak
- hw1-soln.pdfUploaded byPhilip Mak

- HOA7114-17 Man RevDUploaded bytsunamionnet
- E3 FLASHER SLIM CONSOLE Installation Manual With Clip (1)Uploaded byLuis Quevedo
- Mechanical-Nonlin_13.0_App6A_Creep Curve Fitting in MAPDLUploaded byShaheen S. Ratnani
- Curriculum VitaeUploaded byKaranjit Singh
- Command Hq Manual PDFUploaded byHolly
- Arduino Calculator _ VathsavUploaded byShodiq Winarko
- DBMS Project IdeasUploaded bysaya0000
- The Perspective of PrintUploaded byRobert Leston
- Hansen Broch 415 Eng Lr0411Uploaded byAshish Ranjan
- CummingsSNUG2002SJ_FIFO1Uploaded byvigneshk85
- Case LongUploaded byDwight Hunter
- Unix for Talend AbinitioUploaded byM MadhuM
- On Duplicate MAC AddressesUploaded byJefferson F. Ibera
- ProblemUploaded byxyza304gmailcom
- assignment 1 info literacy awolusiUploaded byapi-311643306
- Dbms Lab Manual_ii b.tech It Semii (2017-18)Uploaded bypriya siju
- TREX-03516Uploaded byOSDocs2012
- Krishna Mohan u iUploaded byraaman
- Fast Formula Reference Guide R13 Oracle Fusion Time and Labor Oct2018Uploaded byAhmed Abdullah
- KM1Uploaded byarmk_0073141
- Self-Reference and Computational Complexity Chris LanganUploaded byLecks90
- 1231_maplelabtestUploaded byMathew Chen
- Electronic Return Cum ChallanUploaded byAnonymous V9E1ZJtwoE
- Creating WCF Data ServicesUploaded bytjahsolo
- Design n Analysis of 8t Sram Leakage TechniquesUploaded byPullareddy Avula
- WPS_TestPlan_v1-14_20100820aUploaded byMarco Lee
- A Efficient Dynamic aware Public Auditing for Cloud Data storage with Fair Arbitration.docxUploaded byJayaprabhu Prabhu
- Accurate Seat Belt Detection in Road Surveillance Images Based on CNNUploaded byrsingh2083
- Dhcpd.conf.5Uploaded byAgostinho Sousa
- gams review 2-revisedUploaded byapi-302577842