ALPHA LABELINGS OF DISJOINT UNION OF HAIRY CYCLES
Abstract
In this paper, we prove the following results: 1) the disjoint union of \(n\geq 2\) isomorphic copies of the graph which is obtained by adding a pendent edge to each vertices of the cycle of order 4 admits \(\alpha\)-valuation; 2) the disjoint union of two isomorphic copies of the graph which is obtained by adding \(n\geq 1\) pendent edge to each vertices of the cycle of order 4 is admits \(\alpha\)-valuation; 3) the disjoint union of two isomorphic copies of the graph obtained by adding a pendent edge to each vertex of the cycle of order \(4m\) admits \(\alpha\)-valuation; 4) the disjoint union of two non-isomorphic copies of the graph obtained by adding a pendent edge to each vertices of the cycle of order \(4m\) and \(4m-2\) admits \(\alpha\)-valuation; 5) the disjoint union of two isomorphic copies of the graph which is obtained by adding a pendant edge to each vertex of the cycle of order \(4m-1(4m+2)\) is admitted graceful (\(\alpha\)-valuation).
Keywords
Full Text:
PDFReferences
- Abrham J., Kotzig A. Graceful valuations of 2-regular graphs with two components. Discrete Math., 1996. Vol. 150, No. 1–3. P. 3–15. DOI: 10.1016/0012-365X(95)00171-R
- Balakrishnan R., Ranganathan K. A Textbook of Graph Theory, 2nd ed. NY: Springer, 2012. 292 p. DOI: 10.1007/978-1-4614-4529-6
- Barrientos C. Equitable labeling of corona graphs. J. Comb. Math. Comb. Comput., 2002. Vol. 41. P. 139–149.
- Barrientos C. Graceful graphs with pendant edges. Australas. J. Comb., 2005. Vol. 33. P. 99–107.
- Barrientos C., Minion S. Constructing graceful graphs with caterpillars. J. Algorithms Comput. 2016. Vol. 48, No. 1. P. 117–125. DOI: 10.22059/jac.2016.7946
- Eshghi K., Carter M. Construction of α-valuations of special classes of 2-regular graphs Math. Comput. Sci. Eng., 2001. P. 139–154.
- Frucht R., Harary F. On the corona of two graphs. Aequationes Math., 1970. Vol. 4. P. 322–325. DOI: 10.1007/BF01844162
- Frucht R.W., Salinas L.C. Graceful numbering of snakes with constraints on the first label. Ars Comin., 1985. Vol. 20B. P. 143–157.
- Gallian J.A. A dynamic survey of graph labeling. 23-th ed. Electron. J. Combin., 2023. Art. no. #DS6. P. 1–644. DOI: 10.37236/27
- Graf A. A new graceful labeling for pendant graphs. Aequat. Math., 2014. Vol. 87. P. 135–145. DOI: 10.1007/s00010-012-0184-4
- Kumar J., Mishra D., Kumar A., Kumar V. Alpha labeling of cyclic graphs. Int. J. Appl. Comput., 2021. Vol. 7, Art. no. 151. P. 1–7. DOI: 10.1007/s40819-021-01084-5
- Kumar A, Mishra D, Verma A., Srivastava V.K. Alpha labeling of cyclic graphs. I. ARS Combinatorics, 2021. Vol. 154. P. 257–263.
- Lakshmi D.R., Vangipuram S. An α-valuation of quadratic graph Q(4,4k). Proc. Nat. Acad. Sci., India, Sect. A, 1987. Vol. 57, No. 4. P. 576–580.
- Minion S., Barrientos C. Three Graceful Operations. J. Alg. Comp., 2014. Vol. 45, No. 1. P. 13–24. DOI: 10.22059/jac.2014.7917.
- Pradhan P., Kumar A. Graceful hairy cycles with pendent edges and some properties of cycles and cycle related graphs. Bull. Calcutta Math. Soc., 2012. Vol. 104. P. 61–76.
- Pradhan P., Kumar K. On graceful labeling of some graphs with pendant edges. Gen. Math. Notes, 2014. Vol. 23, No. 2. P. 51–62.
- Pradhan P., Kumar K. On k-graceful labeling of some graphs. J. Appl. Math. Inform., 2016. Vol. 34, No. 1–2. P. 9–17. DOI: 10.14317/jami.2016.009.
- Pradhan P., Kumar A., Mishra D. On gracefulness of graphs obtained from hairy cycles. J. Combin. Inform. Syst. Sci., 2010. Vol. 35, P. 471–480.
- Ringel G. Problem 25. In: Theory of Graphs and its Application. Proc. Symposium Smolenice 1963. Prague, 1964.
- Ropp D. Graceful labelings of cycles and prisms with pendant points. Congr. Number, 1990. Vol. 75. P. 218–234.
- Rosa A. On certain valuations of the vertices of a graph. In: Theory of Graphs: Int. Symposium, Rome, July 1966). N.Y. and Dunod Paris: Gordon and Breach, 1967. P. 349–355.
- Truszczyński M. Graceful unicyclic graphs. Demonstratio Math., 1984. Vol. 17. P. 377–387.
Article Metrics
Refbacks
- There are currently no refbacks.












