On the Structure of Contractible Edges in kconnected Partial ktrees
 N. S. Narayanaswamy,
 N. Sadagopan,
 L. Sunil Chandran
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a kconnected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called noncontractible. In this paper, we present results on the structure of contractible edges in ktrees and kconnected partial ktrees. Firstly, we show that an edge e in a ktree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2connected graph. We also show that there are at least V(G) + k − 2 contractible edges in a ktree. Secondly, we show that if an edge e in a partial ktree is contractible then e is contractible in any ktree which contains the partial ktree as an edge subgraph. We also construct a class of contraction critical 2kconnected partial 2ktrees.
 Ando, K., Kaneko, K., Kawarabayashi, A.: Vertices of degree 5 in a 5contraction critical graph. Graphs Combin 21(1), 27–37 (2005)
 Arnborg, S., Proskurowski, A.: Linear time algorithms for NPhard problems restricted to partial ktrees. Discrete Appl. Math. 23, 11–24 (1989)
 Dean, N., Hemminger, R.L., Toft, B.: On contractible edges in 3connected graphs. Congr. Numer. 58, 291–293 (1987)
 Dean, N., Hemminger, R.L., Ota, K.: k Longest cycles in 3connected graphs contain three contractible edges. J. Graph Theory 13(1), 17–21 (1989)
 Dean, N.: Distribution of contractible edges in kconnected graphs. J. Combin. Theory, Ser. B, 48, 1–5 (2003)
 Ellingham, M.N., Hemminger, R.L., Johnson, K.E.: Contractible edges in longest cycles in nonhamiltonian graphs. Discrete Math. 133 89–98 (1994)
 Fujita, K.: Maximum number of contractible edges on Hamiltonian cycles of a 3connected graph. Graphs Combin. 18(3), 447–478 (2005)
 Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, London (1980)
 Jani, M., Rieger, R.G., Zeleke, M.: Enumeration of ktrees and applications. Ann. Combin. 6, 375–382 (2002)
 Kriesell, M.: A survey on contractible edges in graphs of a prescribed vertex connectivity. Graphs Combin. 18, 1–30 (2002)
 Mandaltsis, D., Kontoleon, J.M.: Enumeration of ktrees and their applications to the reliability evaluation of communication networks. Ann. Combin. 29, 733–735 (1989)
 Martinov, N.: Uncontractible 4connected graphs. J. Graph Theory 6, 343–344 (1982)
 Martinov, N.: A recursive characterisation of 4connected graphs. Discrete Math. 84, 105–108 (1990)
 Proskurowski, A.: Recursive graphs, recursive labelings and shortest paths. SIAM J. Comput. 10(2), 391–397 (1981)
 Saito, A.: Covering contractible edges in 3connected graphs. J. Graph Theory 14(6), 635–643 (1990)
 Saito, A., Ando, K., Enomoto, H.: Contractible edges in 3connected graphs. J. Combin. TheoryB 42(1) (1987)
 Rose, D.J.: Triangulated graphs and elimination process. J. Math. Anal. Appl. 32, 597–609 (1970)
 Rose, D.J.: On simple characterisations of ktrees. Discrete Math. 7, 317–322 (1974)
 Thomassen, C.: Nonseparating cycles in kconnected graphs. J. Graph Theory 5, 351–354 (1981)
 Tutte, W.T.: A theory of 3connected graphs. Indag. Math 23, 441–455 (1961)
 West, D.B.: Introduction to graph theory. Prentice Hall of India (2003)
 Yang, D., Iwama, K., Naoki, K.: A new probabilistic analysis of Karger’s randomized algorithm for mincut problems. Inf. Process. Lett. 64(5), 255–261 (1997)
 Title
 On the Structure of Contractible Edges in kconnected Partial ktrees
 Journal

Graphs and Combinatorics
Volume 25, Issue 4 , pp 557569
 Cover Date
 20091101
 DOI
 10.1007/s003730090851y
 Print ISSN
 09110119
 Online ISSN
 14355914
 Publisher
 Springer Japan
 Additional Links
 Topics
 Keywords

 Connectivity
 Contraction
 Contractible edges
 Partial ktrees
 Industry Sectors
 Authors

 N. S. Narayanaswamy ^{(1)}
 N. Sadagopan ^{(1)}
 L. Sunil Chandran ^{(2)}
 Author Affiliations

 1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India
 2. Computer Science and Automation, Indian Institute of Science, Bangalore, 560012, India