No Detail Found!

ON k-Semi-Perfect 1-Factorizations of Cartesian Product of Graphs

Author(s)
Hemalatha P Department of Mathematics, Vellalar College for Women, Erode, India
Jamuna L Department of Mathematics, Vellalar College for Women, Erode, India
Abstract
Let , and , respectively denote a cycle of length n, a complete graph on n vertices and a complete bipartite graph on m,n vertices. An r-factor of G is a r-regular spanning subgraph of G. A 1factorization of a graph G of even order is a partition of the edges of G into disjoint 1-factors. A 1factorization of a graph G is said to be k-Semi-Perfect, if ? forms a Hamilton cycle for every 1=i=k and every k+1=j=n. In this paper it is shown that the Cartesian product of some special classes of graphs such as admits a k-Semi-Perfect 1-factorization.
Publication Details
Page(s) 1-98
DOI DOI not available
Published Journal: International Journal of Communication Networks and Information Security, Volume: 16, Issue: 3, Year: 2024

Request the full text from PASTIC

Keywords
Complete Graph, Cartesian product, Complete Bipartite Graph, k-Semi-Perfect 1-Factorization, Cycles
References
Rosa A. .2019 .. , 69(3) : 479-496.
Anderson B. A. .1974 .A class of starter induced 1-factorizations. , : 180-185.
Bondy J. .1976 .. Graph Theory with Applications, : .
Chitra V.,Muthusamy A. .2013 .A note on semi-perfect 1-factorization and craft′s conjecture,”. Graph Theory Notes of New York, : 58-62.
Craft D. L. .1998 .On the genus of joins and compositions of graphs,”. Discrete Mathematics, 178(97) : 81815-8.
Archdeacon D. .2024 .. , 11 : .
Pike D. A. .2019 .A perfect 1-factorization of K56,”. Journal of Combinatorial Design, 27(4) : 386-390.
Ganesamurthy S.,Manikandan R. .2021 .Decomposition of some classes of regular graphs and digraphs into cycles of length 4p,”. Australasian Journal of Combinatorics, 79(2) : 215-233.
Chartrand G.,Lesniak L.,Zhang P. .2011 .. , : .
Kirkman T. P. .1847 .On a problem in combinatorics. , 21 : 191-204.
Kotzig A. .1962 .Construction for hamilton graph of third degree. ” Cas. Pest. Matem, 87 : 148-168.
Kotzig A. .1964 .Hamiltonian graphs and hamiltonian circuits. Theory of graphs and its application,” in Proceeding of the Symposium of Smolenice, : 62-82.
Kotzig A. .1979 .1-factorizations of Cartesian products of regular graphs. ” Journal of Graph Theory, 3 : 23-34.
Lindner C.,Charles C.A.,Rodger C.A. .2009 .. , : .
Gill M. J.,Wanless I. M. .2020 .-factorization of K16,”. Bulletin of the Australian Mathematical Society, 101(2) : 177-185.
Astromujoff N.,Matamala M. .2015 .A quantitative approach to perfect 1- factorizations of complete bipartite graphs,”. The Electronic Journal of Combinatorics, 22 : .
Behague N. C. .2019 .Semi-perfect 1-factorizations of the hypercube. Discrete Mathematics, 342 : 1696-1702.
Pisanski T.,Shawe-Taylor J.,Mohar J.,Publications De L'Institut Mathematique J. .1983 .1-factorization of the composition of regular graphs. , 33(47) : .
Kralovic R.,Kralovic R. .2005 .On semi-perfect 1-factorizations. ” Lecture Notes in Computer Science, 3499 : 216-230.
Revathi R.,Jothi R. M. J. .2019 .Structural behaviour of MMD labeling on some SSP bipartite graphs. The Journal of Analysis, 27 : 173-178.
Gochev V.,I. Gotchev V.,Perfect V. .2010 .-factorizations of Qn and Craft's Conjecture,”. Graph Theory Notes of New York, 58 : 36-41.
Wallis W. D. .1985 .On one-factorizations of cartesian products. ” Congr.Number, 49 : 237-245.
0

Citations

0

Downloads

138

Views