A Study on Equitable Triple Connected Domination Number of a Graph
| Author | : M. Subramanian |
| Publisher | : Infinite Study |
| Total Pages | : 13 |
| Release | : |
| ISBN-10 | : |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis A Study on Equitable Triple Connected Domination Number of a Graph by : M. Subramanian
Download or read book A Study on Equitable Triple Connected Domination Number of a Graph written by M. Subramanian and published by Infinite Study. This book was released on with total page 13 pages. Available in PDF, EPUB and Kindle. Book excerpt: A graph G is said to be triple connected if any three vertices lie on a path in G. A dominating set S of a connected graph G is said to be a triple connected dominating set of G if the induced subgraph hSi is triple connected.