Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Domination dot stable trees
Yamuna M
Published in International Journal of Pharmacy and Technology
2016
Volume: 8
Issue: 2
Pages: 13564 - 13568
Abstract
A graph G is said to be domination dot stable (DDS) if γ (G • uv) = γ (G), for all u, v ∈ V (G), u adjacent to v. In this paper, we provide a constructive characterization of DDS trees. © 2016, International Journal of Pharmacy and Technology. All rights reserved.
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
International Journal of Pharmacy and Technology
Publisher
International Journal of Pharmacy and Technology
ISSN
0975766X
Authors (1)
Yamuna M
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
Finding shortest path between two locations using matrix representation
Non - domination subdivision stable graphs
Domination Parameter Characterization using Matrix Representation
Matrix representation – Hajos stable graphs
Get all the updates for this publication
Follow