Resolving Domination Numbers of Family of Tree Graph
All graph in this paper are members of family of graph tree. Let G is a connected graph, for an ordered set W={w1,w2,...,wk} of vertices and a vertex which is not element of W, then W is dominating set of graph G when the vertices that are not listed at W are vertices which are adjacent with W. The...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Academic Paper |
| Published: |
International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January - 2020, Pages: 27-30,
2020-06-25T04:53:12Z.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |