Subdividing an edge in the graph may increase the domination number or remains the same. In this paper, we introduce a new kind of graph called non - domination subdivision stable graph (NDSS). We obtain a necessary and sufficient condition for a graph to be NDSS. We provide a constructive characterization of NDSS trees and a MATLAB program for identifying NDSS graphs. © Published under licence by IOP Publishing Ltd.

Yamuna M

Department of Mathematics

School of Advanced Sciences

Vellore Campus

Elakkiya A.

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Non - domination subdivision stable graphs

IOP Conference Series: Materials Science and Engineering

In this paper, we characterize planarity and outer planarity of complement of graph domination graphs and provide a MATLAB program for identifying graph domination graphs.

International Journal of Engineering & Technology

Planar Characterization – Graph Domination Graphs

Network behavior in the presence of fault can be analyzed, by determining the effect of graph operations that the underlying graph G has, on the fault tolerance criteria. It is important that the domination number of graph is not modified when G is modified. A tree is a smallest connected graph that can be used in such cases. In this paper, we provide a constructive characterization of domination subdivision stable trees. © 2016 Pushpa Publishing House, Allahabad, India.

Far East Journal of Mathematical Sciences (FJMS)

DOMINATION SUBDIVISION STABLE TREES

For a given non-adjacent pair {x, y} in a graph G, we denote by Gxy the graph obtained by deleting x and y and adding a new vertex xy adjacent to precisely those vertices of G-x-y which were adjacent to at least one of x or y in G. We say that Gxy is obtained by contracting on {x, y}. In this paper we introduce -stable graphs and we have established that γstable trees have a unique structure. © 2013 Academic Publications, Ltd.

Journal	Data powered by TypesetIOP Conference Series: Materials Science and Engineering
Publisher	Data powered by TypesetIOP Publishing
ISSN	1757-8981
Open Access	Yes