scholarly journals EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS

Author(s):  
Albert Khachik Sahakyan
Keyword(s):  

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

2020 ◽  
Vol 44 (6) ◽  
pp. 1633-1639
Author(s):  
Behnaz Omoomi ◽  
Marzieh Vahid Dastjerdi ◽  
Yasaman Yektaeian
Keyword(s):  

2020 ◽  
Vol 9 (11) ◽  
pp. 9311-9317
Author(s):  
K. Sivaraman ◽  
R.V. Prasad

Equitable edge coloring is a kind of graph labeling with the following restrictions. No two adjacent edges receive same label (color). and number of edges in any two color classes differ by at most one. In this work we are going to present the Fuzzy equitable edge coloring of some wheel related graphs.


2021 ◽  
Vol 19 (1) ◽  
pp. 706-723
Author(s):  
Yuri V. Muranov ◽  
Anna Szczepkowska

Abstract In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau. We give the construction of the path homology theory for edge-colored graphs that follows immediately from the consideration of natural functor from the category of graphs to the subcategory of symmetrical digraphs. We describe the natural filtration of path homology groups of any digraph equipped with edge coloring, provide the definition of the corresponding spectral sequence, and obtain commutative diagrams and braids of exact sequences.


2021 ◽  
Vol 94 (2) ◽  
pp. 113-117
Author(s):  
Jimmy Dillies

2017 ◽  
Vol 340 (3) ◽  
pp. 481-493
Author(s):  
Ayineedi Venkateswarlu ◽  
Santanu Sarkar ◽  
Sai Mali Ananthanarayanan

Sign in / Sign up

Export Citation Format

Share Document