The origin of graph theory can be traced to leonhard euler who devised in 1735 a problem. On spanning kedgecolorable subgraphs 7 it can b e easily seen that the comp o nen ts of the resulting subgraph h of t are stars, suc h that their cen ters are of degree at most. These notes will be helpful in preparing for semester exams and competitive exams like gate, net and psus. A graph \sv,e,\gamma\ is called a subgraph of \g\, written as \s\subseteq g\, if it fulfills the. For the love of physics walter lewin may 16, 2011 duration. This is not covered in most graph theory books, while graph. In other words, h is a spanning subgraph of g if h is a subgraph of g, and h has the same vertex set as g. I year dkm15 graph theory and combinatorics manonmaniam. A spanning subgraph or spanning super graph of g is a subgraph. Pdf sierpinski graphs as spanning subgraphs of hanoi graphs. Get the notes of all important topics of graph theory subject. Grid paper notebook, quad ruled, 100 sheets large, 8. We can obtain subgraphs of a graph by deleting edges and vertices.
1095 1619 1249 507 620 1498 505 1613 893 1135 1049 1320 65 1033 945 1306 941 164 50 890 1548 504 1319 398 599 367 132 909 97 1280 886 1355 1466 1241 42 487 1365 1029 32 258 197 857