Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation

2019 ◽  
Author(s):  
Yihua Ding ◽  
James Wang ◽  
Pradip Srimani
Keyword(s):  
Token Circulation ◽  
Cactus Graphs ◽  
Topology Computation

Self-stabilizing depth-first token circulation in arbitrary rooted networks

2000 ◽  
Vol 13 (4) ◽  
pp. 207-218 ◽  
Author(s):  
Ajoy K. Datta ◽  
Colette Johnen ◽  
Franck Petit ◽  
Vincent Villain
Keyword(s):  
Token Circulation

scholarly journals Multiplicative Zagreb indices of cacti

2016 ◽  
Vol 08 (03) ◽  
pp. 1650040 ◽  
Author(s):  
Shaohui Wang ◽  
Bing Wei
Keyword(s):  
Graph Theory ◽  
Lower Bounds ◽  
Connected Graph ◽  
Upper And Lower Bounds ◽  
Extremal Graphs ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Material Chemistry ◽  
Cactus Graph ◽  
Cactus Graphs

Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs.

The arithmetical rank of the edge ideals of cactus graphs

2017 ◽  
Vol 45 (12) ◽  
pp. 5407-5419
Author(s):  
Margherita Barile ◽  
Antonio Macchia
Keyword(s):  
Edge Ideals ◽  
Arithmetical Rank ◽  
Cactus Graphs

scholarly journals An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs

2019 ◽  
Vol 7 (4) ◽  
pp. 639-645
Author(s):  
Sambhu Charan Barman, ◽  
Madhumangal Pal ◽  
Sukumar Mondal
Keyword(s):  
Shortest Path ◽  
Optimal Algorithm ◽  
Cactus Graphs

scholarly journals EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS

2021 ◽  
Author(s):  
Albert Khachik Sahakyan
Keyword(s):  
Edge Coloring ◽  
Cactus Graphs

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

Broadcasting on cactus graphs

2015 ◽  
Vol 33 (1) ◽  
pp. 292-316 ◽  
Author(s):  
Maja Čevnik ◽  
Janez Žerovnik
Keyword(s):  
Cactus Graphs

Self-stabilizing depth-first token circulation on networks

1993 ◽  
Vol 7 (1) ◽  
pp. 61-66 ◽  
Author(s):  
Shing-Tsaan Huang ◽  
Nian-Shing Chen
Keyword(s):  
Token Circulation
Sign in / Sign up

Export Citation Format

Share Document