PL EN


Preferences help
enabled [disable] Abstract
Number of results
2019 | 135 | 48-58
Article title

Induced weak cycle number of path and its derived graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
Let G = (V, E) be a simple connected graph. The induced weak cycle partition of G is defined as the partition of V(G) into subsets such that each subset induces a cycle or K2 or K1. The induced weak cycle number of G, denoted by ρ_wc (G), is the minimum cardinality taken over all induced weak cycle partitions. In this paper, the concept of induced weak cycle number is introduced and induced weak cycle number of path and some of its derived graphs are studied.
Year
Volume
135
Pages
48-58
Physical description
Contributors
author
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India
author
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India
References
  • [1] J.A. Bondy and U.S.R. Murty, Graph Theory, Springer 2008.
  • [2] I. Broere, E. Jonck, M. Voigt, The induced path number of a complete multipartite graph, Tatra. Mt. Math. Publi. 9 (1996) 83-88
  • [3] G. Chartrand, J. Mc. Canna, N. Sherwani, J. Hashmi and M. Hosssain, The induced path number of bipartite graphs, Ars Combi. 37(1994) 191-208
  • [4] Jun-Jie Pan and Gerard J. Chang, Induced-path partition on graphs with special blocks, Theoretical Computer Science 370 (2007) 121-130
  • [5] Zhiquan Hu and HaoLi, Partition of a graph into cycles and vertices, Discrete Mathematics 307 (2007) 1436-1440
  • [6] S.Y. Alsardary, The induced path number of the hypercube, Congr. Numer. 128 (1997) 5–18.
  • [7] I. Broere, E. Jonck, M. Voigt, The induced path number of a complete multipartite graph, Tatra Mt. Math. Publ. 9 (1996) 83-88.
  • [8] G. Chartrand, H.V. Kronk, C.E. Wall, The point arboricity of a graph. Israel J. Math. 6 (1968) 169-175.
  • [9] R.G. Stanton, D.D. Cowan, L.O. James, Some results on path numbers, in: Proc. Louisiana Conference on Combin. Graph Theory and Computing, Baton Rouge 1970, pp. 112-135.
  • [10] H.-O. Le, V.B. Le, H. M¨uller, Splitting a graph into disjoint induced paths or cycles, Discrete Appl. Math. 131 (2003) 199-212.
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-d3fd8623-c0a7-4e28-a9e2-4f4584450015
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.