#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- T. N. Janakiraman, M. Bhanumathi, S. Muthammai
- Ars Comb.
- 2008

Let G = (V, E) be a simple graph. A dominating set D is called a complementary tree dominating set if the induced subgraph <VD> is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number of G and is denoted by ctd(G). For a graph G, let V(G) = {v : v V(G)} be a copy of V(G). The… (More)

- S. Muthammai, G. Ananthavalli
- 2017

A set D of a graph G = (V,E) is a dominating set, if every vertex in V (G) − D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. A dominating set D is called a complementary tree nil dominating set, if V (G)−D is not a dominating set and also the induced subgraph 〈V (G)−D〉 is a tree. The minimum… (More)

- S. Muthammai
- 2015

For any graph G, let V(G) and E(G) denote the vertex set and edge set of G respectively. The Boolean function graph B(G, L(G), NINC) of G is a graph with vertex set V(G)E(G) and two vertices in B(G, L(G), NINC) are adjacent if and only if they correspond to two adjacent vertices of G, two adjacent edges of G or to a vertex and an edge not incident to it in… (More)

- S. Muthammai, G. Ananthavalli
- 2016

A set D V of a graph G = (V, E) is a dominating set, if every vertex in V(G) D is adjacent to some vertex in D. The domination number (G) of G is the minimum cardinality of a dominating set. A dominating set D of a connected graph G is called a complementary tree nil dominating set if the induced subgraph < V (G) D > is a tree and V(G) D is not a… (More)

A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. A dominating set D is called a complementary tree dominating set if the induced subgraph < V −D > is a tree. The minimum cardinality of a complementary tree dominating set… (More)

For any graph G, the Equi-eccentric point set graph Gee is defined on the same set of vertices by joining two vertices in Gee if and only if they correspond to two vertices of G with equal eccentricities. The Glue graph Gg is defined on the same set of vertices by joining two vertices in Gg if and only if they correspond to two adjacent vertices of G or two… (More)

- T. N. Janakiraman, S. Muthammai, M. Bhanumathi
- Ars Comb.
- 2007

- ‹
- 1
- ›