Skip to search formSkip to main contentSkip to account menu

Cactus graph

Known as: Cactus (disambiguation) 
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Binary matroidCombinatorial optimizationCycle (graph theory)Cycle double cover

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding
The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner. For… 
2015
2015
EXTREMAL ATOM-BOND CONNECTIVITY INDEX OF CACTUS GRAPHS
Abstract. The atom-bond connectivity index of a graph G(ABC indexfor short) is defined as the summation of quantitiesq d(u)+d(v… 
2012
2012
A Self-stabilizing Algorithm for the Maximal 2-packing in a Cactus Graph
In this paper we present a time optimal self-stabilizing algorithm for the maximal 2-packing in a cactus graph. The cactus is a… 
2012
2012
L(0, 1)-Labelling of Cactus Graphs
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between… 
2009
2009
Edge Colouring of Cactus Graphs
  • 2009
  • Corpus ID: 124349033
Edge colouring of an undirected graph G = (V;E) is assigning a colour to each edge e2 E so that any two edges having end-vertex… 
2006
2006
Bounds on the 2-domination number in cactus graphs
A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at… 
2005
2005
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph
In this paper, we provide efficient algorithms for solving the weighted center problems in a cactus graph. In particular, an O(n… 
1998
1998
The ratio of the irredundance number and the domination number for block-cactus graphs
Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc… 
1995
1995
A generalization of menger's theorem for certain block—cactus graphs
A graphG is called a block—cactus graph if each block ofG is complete or a cycle. In this paper, we shall show that a block… 
Review
1994
Review
1994
A characterization of well covered block-cactus graphs
A graph G is well covered, if any two maximal independent sets of G have the same number of vertices. A graph is called a block… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)