Open Access
Original Articles
Factors of Inserted Graphs
L.K. Pramaniklaxmikanta2002@yahoo.co.inDepartment of Pure MathematicsUniversity of Calcutta35, Ballygunge Circular Road Kolkata-700019View full profile → , M.R. Adhikaricms@cal2.vsnl.net.inDepartment of Pure MathematicsUniversity of Calcutta35, Ballygunge Circular Road Kolkata-700019View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 12 Jan 2006
- Published Online:
- 03 Jun 2013
- Article type:
- Original Articles
- Language:
- EN
- Article no.:
- 1726037X.2006.10698513
- Pages:
- 159–165
Abstract
A k-regular spanning subgraph of G is called a k-factor of G. In this paper we give a necessary and sufficient condition for the inserted graph I(G) of a non-trivial graph G to have a 1-factor. If denotes the degree of the vertex v in G and if for all vertices v in G, where is an even integer then we prove that the inserted graph I(G) of G has a 2m-factor. Also we prove that if m is a non-negative integer and G is a connected graph with even number of edges such that for all vertices v in G, then the inserted graph I(G) of G has a -factor.
Keywords
References
- Adhikari, M.R., Pramanik, L.K. and Parui, S.2005 . On Box Graph and its Square . , 13 : 61 – 64 . 1,2
- Akiyama, J. and Kano, M.1985 . factors and factorizations of graphs - a survey . , 9 : 1 – 42 .
- Beineke, L.W. and Plummer, M.D.1967 . On the 1-factors of a non-separable graph . , 2 : 285 – 289 .
- Bondy, J.A. and Murty, U.S.R.1976 . , London: Macmillan .
- Tutte, W.T.1947 . The factorization of linear graphs . , 22 : 107 – 111 .
- Tutte, W.T.1952 . The factors of graphs . , 4 : 314 – 328 .
- Tutte, W.T.1954 . A short proof of factor theorem for finite graphs . , 6 : 347 – 352 .
Views: 68Downloads: 78Citations: 1
