Abstract
An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in α and is denoted by
Highlights
All graphs considered in this paper are undirected, finite, and have no loops or multiple edges
A cactus is a connected graph in which any two simple cycles have at most one vertex in common. It is a connected graph in which every edge belongs to at most one simple cycle
For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in α and is denoted by Sα(v)
Summary
EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS Albert Khachik Sahakyan Albert Khachik Sahakyan. (2021) Edge Coloring of Cactus Graphs with Given Spectrums. EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS Albert Khachik Sahakyan Albert Khachik Sahakyan. (2021) Edge Coloring of Cactus Graphs with Given Spectrums.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
