3-Successive C-edge coloring of graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0803/0003Abstract
The 3 -successive $c$-edge coloring number $\bar{\psi}_{3 s}^{\prime}(G)$ of a graph $G$ is the highest number of colors that can occur in a coloring of the edges of $G$ such that every path on three edges has at most two colors. In this paper, we obtain some exact values of 3-successive $c$-edge coloring number. Also, we attempt to find bounds of $\bar{\psi}_{3 s}^{\prime}(G)$ for different product of graphs which includes Cartesian, direct, strong, rooted and corona. The 3-successive $c$-edge achromatic sum is the maximum sum of colors among all the 3-successive $c$-edge coloring of $G$ with highest number of colors. We also determine the 3-successive $c$-edge achromatic sum for some classes of graphs.
Keywords:
3-successive c-edge coloring, 3-successive c-edge coloring number, 3-successive c-edge achromatic sum, 3-consecutive edge coloring number, anti ramsey numberMathematics Subject Classification:
Mathematics- Pages: 744-752
- Date Published: 01-07-2020
- Vol. 8 No. 03 (2020): Malaya Journal of Matematik (MJM)
Saeed AkhoondianAmiri, Alexandru Popa, GolnooshShahkarami and Hossein Vahidi, Complexity of computing the anti-Ramsey numbers, arXiv: $1810.08004 mathrm{v} 2$ [cs.CC] 9 Mar 2019.
Slamin, M. Baca, Y. Lin, M. Miller, and R. Simanjuntak, Edge-magic total labelings of wheels, fans and friendship graphs, Bull. ICA,35 (2002), 89-98.
Cs. Bujtás, E. Sampathkumar, Zs. Tuza, Charles Dominic and L.Pushpalatha, 3-consecutive edge coloring of a graph, Discrete Math. 312 (2012), 561-573.
L. DeAlba, J. Grout, L. Hogben, R. Mikkelson and K. Rasmussen, Universally optimal matrices and field independence of the minimum rank of a graph, Elec. J. Lin. Alg., 18(2019), 403-419.
F. Harary, Graph Theory, Addison-Wesely, Massachusethes, (1969).
AIM Minimum Rank - Special Graphs Work Group, Zero forcing sets and the minimum rank of graphs, Lin. Alg. Appl., 428(2008), 1628-1648.
Frucht, Roberto and Harary, Frank, On the corona of two graphs, Aeq. Math. 4(1970), 322-325.
Amit Saha, Doing Math With Python, No Starch Press, Inc, 2015.
Mohammed Zuhair Al-Taie and SeifedineKadry, Python for Graph and Network Analysis, Springer International Publishing, (2017).
- NA
Similar Articles
- Amira ABDELNEBI, Zoubir DAHMANI, Mehmet Zeki SARIKAYA, New classes of fractional integral inequalities and some recent results on random variables , Malaya Journal of Matematik: Vol. 8 No. 03 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.