D. Antony Xavier1
, Bino Infanta L.G2
Section:Research Paper, Product Type: Journal Paper
Volume-07 ,
Issue-05 , Page no. 20-24, Mar-2019
CrossRef-DOI:
https://doi.org/10.26438/ijcse/v7si5.2024
Online published on Mar 10, 2019
Copyright © D. Antony Xavier, Bino Infanta L.G . 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
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: D. Antony Xavier, Bino Infanta L.G, “On The Strong Edge Monophonic Number of Graphs,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.20-24, 2019.
MLA Style Citation: D. Antony Xavier, Bino Infanta L.G "On The Strong Edge Monophonic Number of Graphs." International Journal of Computer Sciences and Engineering 07.05 (2019): 20-24.
APA Style Citation: D. Antony Xavier, Bino Infanta L.G, (2019). On The Strong Edge Monophonic Number of Graphs. International Journal of Computer Sciences and Engineering, 07(05), 20-24.
BibTex Style Citation:
@article{Xavier_2019,
author = {D. Antony Xavier, Bino Infanta L.G},
title = {On The Strong Edge Monophonic Number of Graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {20-24},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=798},
doi = {https://doi.org/10.26438/ijcse/v7i5.2024}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.2024}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=798
TI - On The Strong Edge Monophonic Number of Graphs
T2 - International Journal of Computer Sciences and Engineering
AU - D. Antony Xavier, Bino Infanta L.G
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 20-24
IS - 05
VL - 07
SN - 2347-2693
ER -
Abstract For a connected graph G=(V,E) of order at least two, a set S of vertices of G is a Strong edge Monophonic set if every edge of G is contained in a fixed monophonic path between any pair of vertices of S . The minimum cardinality of the strong edge monophonic set is the strong edge monophonic number of G denoted my Sm_1 (G). In this paper, certain general properties of the strong edge monophonic sets are studied. Also the strong monophonic number of some families of graph are determined.
Monophonic set, Strong monophonic set, Edge monophonic set, Monophonic distance
[1] Harary, Frank, Emmanuel Loukakis, and Constantine Tsouros. "The geodetic number of a graph." Mathematical and Computer Modelling 17.11 (1993): 89-95.
[2] Santhakumaran, A. P., P. Titus, and K. Ganesamoorthy. "On the monophonic number of a graph." Journal of applied mathematics and informatics 32.1-2 (2014): 255-266.
[3] Hernando, Carmen, et al. "On monophonic sets in graphs." Submitted. Google Scholar (2005).
[4] Iršič, Vesna. "Strong geodetic number of complete bipartite graphs and of graphs with specified diameter." Graphs and Combinatorics 34.3 (2018): 443-456.
[9] Manuel, Paul, et al. "Strong geodetic problem in networks: computational complexity and solution for Apollonian networks." arXiv preprint arXiv:1708.03868 (2017).
[6] Klavžar, Sandi, and Paul Manuel. "Strong Geodetic Problem in Grid-Like Architectures." Bulletin of the Malaysian Mathematical Sciences Society (2018): 1-10.
[7] Iršič, Vesna, and Sandi Klavžar. "Strong geodetic problem on Cartesian products of graphs." RAIRO-Operations Research 52.1 (2018): 205-216.
[8] John, J., and P. Arul Paul Sudhahar. "On the edge monophonic number of a graph." Filomat 26.6 (2012): 1081-1089.
[9] Manuel, Paul, et al. "Strong edge geodetic problem in networks." Open Mathematics 15.1 (2017): 1225-1235.
[10] D.Antony Xavier and Elizabeth Thomas. “On the strong monophonic number of a graph.” (To appear)
