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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

We address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the…

2016

Given a graph G, let M(G) and ∏ (G) be Zagreb index and Multiplicative Zagreb index. A connected graph is a cactus graph if and…

2016

For a graph $G$ a subset $D$ of the vertex set of $G$ is a {\it $k$-dominating set} if every vertex not in $D$ has at least $k…

2016

The class of unichord-free graphs was recently investigated in the context of vertex-colouring (Trotignon and Vušković in J Graph…

2013

Suppose = ( , ) G V E be a graph with vertex set V and edge set E . A vertex labelling : {0,1} f V → induces an edge labelling…

2012

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

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…

2010

Abstract. A (2,1)-total labelling of a graph is an assignment of integers to each vertex and edge such that: (i) any two adjacent…

1998

Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc…

1995

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…