Name
Abstract | ||
|---|---|---|
Let G be a graph. The gamma graph of G denoted by gamma center dot G is the graph with vertex set V (gamma center dot G) as the set of all.-sets of G and two vertices D and S of gamma center dot G are adjacent if and only if vertical bar D boolean AND S vertical bar = gamma(G) - 1. A graph H is said to be a.-graph if there exists a graph G such that gamma center dot G is isomorphic to H. In this paper, we show that every induced subgraph of a gamma-graph is also a gamma-graph. Furthermore, if we prove that H is gamma.-graph, then there exists a sequence {Gn} of non-isomorphic graphs such that H = gamma center dot Gn for every n. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1142/S1793830913500122 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Dominating set, domination number, gamma graph | Discrete mathematics,Strongly regular graph,Graph toughness,Combinatorics,Vertex-transitive graph,Edge-transitive graph,Graph power,Bound graph,Neighbourhood (graph theory),Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
5 | 3 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Sridharan | 1 | 10 | 3.71 |
| S. Amutha | 2 | 0 | 0.68 |
| S. B. Rao | 3 | 0 | 0.34 |