Full Paper View Go Back
Operations on Graphs and its Minimum Diameter Spanning Tree
V.T. Chandrasekaran1 , N. Rajasri2
Section:Research Paper, Product Type: Isroset-Journal
Vol.6 ,
Issue.3 , pp.144-148, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijsrmss/v6i3.144148
Online published on Jun 30, 2019
Copyright © V.T. Chandrasekaran, N. Rajasri . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: V.T. Chandrasekaran, N. Rajasri, “Operations on Graphs and its Minimum Diameter Spanning Tree,” International Journal of Scientific Research in Mathematical and Statistical Sciences, Vol.6, Issue.3, pp.144-148, 2019.
MLA Style Citation: V.T. Chandrasekaran, N. Rajasri "Operations on Graphs and its Minimum Diameter Spanning Tree." International Journal of Scientific Research in Mathematical and Statistical Sciences 6.3 (2019): 144-148.
APA Style Citation: V.T. Chandrasekaran, N. Rajasri, (2019). Operations on Graphs and its Minimum Diameter Spanning Tree. International Journal of Scientific Research in Mathematical and Statistical Sciences, 6(3), 144-148.
BibTex Style Citation:
@article{Chandrasekaran_2019,
author = {V.T. Chandrasekaran, N. Rajasri},
title = {Operations on Graphs and its Minimum Diameter Spanning Tree},
journal = {International Journal of Scientific Research in Mathematical and Statistical Sciences},
issue_date = {6 2019},
volume = {6},
Issue = {3},
month = {6},
year = {2019},
issn = {2347-2693},
pages = {144-148},
url = {https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1381},
doi = {https://doi.org/10.26438/ijcse/v6i3.144148}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i3.144148}
UR - https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1381
TI - Operations on Graphs and its Minimum Diameter Spanning Tree
T2 - International Journal of Scientific Research in Mathematical and Statistical Sciences
AU - V.T. Chandrasekaran, N. Rajasri
PY - 2019
DA - 2019/06/30
PB - IJCSE, Indore, INDIA
SP - 144-148
IS - 3
VL - 6
SN - 2347-2693
ER -
300 Views
180 Downloads
88 Downloads
Abstract :
In this paper we present dominating sets, minimum diameter spanning tree for operations on graphs. We find out the minimum diameter spanning tree through the graph of which have a minimum diameter spanning tree such that both have same domination number. The spanning tree of the simple connected graph is said to be a minimum diameter spanning tree. if there is no other spanning tree ` of such that . The diameter of a graph is length of the shortest path between the most distance node.
Key-Words / Index Term :
Domination, Diameter, Ladder graph, Grid graph, star graph, Path, Spanning tree, Cartesian product, co-normal product, lexico graphic product, and union, sum
References :
[1] V.T Chandrasekaran, and N.Rajasri minimum diameter spanning tree, American journal of computational mathematics, 2018, 8, 203 – 208.
[2] Michael S. Jacobson and Lael F. Kinch On the Domination of the Products of Graphs
[3] S.Arumugam and S. Ramachandran, Invitation to Graph theory, copyright @2001 scitch puplications (india) pvt Ltd.
[4] Haray, F. (1969) Graph Theory. Addsion Wesley, Reading, MA.
https://doi.org/10.21236/AD0705364
[5] P.Sharifani ,M.R Hooshmandasl and M.Alambardar Meybodi An explicit construction of optimal dominating and dominating sets in grid.arXiv:1707.0647v3[cs.DM] 2018
[6] Samu Alanko, Simon Crevils, Andon Isopoussu, Patric Ostergard and Ville
Pettersson computing the domination number of grid graphs. The Electronic Journal of Combinatorics 18(2011),# p141
[7] SHEHID UR REHMAN, I.JAVAID. Fixing number of co normal product of graphs :https://www.reserachgate.net/publication/314182293.arXiv: 1703.00709V1.
You do not have rights to view the full text article.
Please contact administration for subscription to Journal or individual article.
Mail us at support@isroset.org or view contact page for more details.
