Advances in Graph TheoryV. R. Kulli |
Contents
A Survey | 1 |
Edge Maximal Graphs with Large Bounded Degree | 11 |
A Degree Condition for Hamiltonian Cycles in tTough | 19 |
Copyright | |
18 other sections not shown
Common terms and phrases
1991 by Vishwa 2-connected adjacent Advances in Graph algorithm bind G block graph bound c₁ channel graph chord chromatic number clique partition complete graph components condition connected graph contradiction Conx(G Corollary cut vertex defined denote Department of Mathematics digraph Discrete Math disjoint edge-cutset eulerian trail exists F-polynomials F.K. Hwang Figure G contains G₁ G₂ graph G graph of order Graph Theory H₁ Hamilton cycles hamiltonian cycles Hence hypergraph induced integer isomorphic K₁ least Lemma Let G m-edge-connected maximum matching minimum degree multiplex networks number of edges obtained optimal digraph oriented matroid P₁ path polynomial Prob problems Proof proper subgraph random hypertree Reconstruction Conjecture regular graph result rotation number set of vertices SP-canopy subset Suppose Theorem total dominating set tree u₁ V.R. Kulli v₁ vertex degree Vishwa International Publications voltage graph w₁ x₁ Xp G Ycon