AVD proper edge-coloring of some families of graphs
J. Naveen
International Journal of Mathematics for Industry · 2021
doi:10.1142/s2661335222500010 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors. The minimum number of colors required for an adjacent vertex-distinguishing proper edge-coloring of [Formula: see text] is called the adjacent vertex-distinguishing proper edge-chromatic index. Adjacent vertex-distinguishing proper edge-chromatic indices of the middle graph, splitting graph and shadow graph of path and cycle are determined. Adjacent vertex-distinguishing proper edge-chromatic indices of the triangular grid [Formula: see text], [Formula: see text]-graph and generalized [Formula: see text]-graph are also determined.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.