Advanced search
Publication Cover
International Journal of Computer Mathematics: Computer Systems Theory Volume 7, 2022 - Issue 1
Submit an article Journal homepage
62
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Minimal total open monophonic sets in graphs

A. P. Santhakumarana Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, IndiaView further author information
,
M. Mahendrana Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, IndiaView further author information
,
F. Simon Raja Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, IndiaView further author information
&
K. Ganesamoorthyb Department of Mathematics, Coimbatore Institute of Technology, Coimbatore, IndiaCorrespondence[email protected]
View further author information
Pages 6-15 | Received 15 Sep 2020, Accepted 14 Aug 2021, Published online: 19 Sep 2021

References

  • F. Buckley and F. Harary. Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
  • G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw-Hill Education (India) Private Limited, New Delhi, 2005.
  • E.R. Costa, M.C. Dourado, and R.M. Sampaio, Inapproximability results related to monophonic convexity, Discrete Appl. Math. 197 (2015), pp. 70–74.
  • M.C. Dourado, F. Protti, and J.L. Szwarcfiter, Algorithmic aspects of monophonic convexity, Electronic Notes Discrete Math. 30 (2008), pp. 177–182.
  • M.C. Dourado, F. Protti, and J.L. Szwarcfiter, Complexity results related to monophonic convexity, Discrete Appl. Math. 158 (2010), pp. 1268–1274.
  • T. Mansour and M. Schork, Wiener, hyper-Wiener detour and hyper-detour indices of bridge and chain graphs, J. Math. Chem. 47 (2010), pp. 72–98.
  • P.A. Ostrand, Graphs with specified radius and diameter, Discrete Math. 4 (1973), pp. 71–75.
  • E.M. Palugaa and S.R. Canoy, Monophonic numbers of the join and composition of connected graphs, Discrete Math. 307 (2007), pp. 1146–1154.
  • A.P. Santhakumaran and M. Mahendran, The upper open monophonic number of a graph, Proyeccion. J. Math. 33(4) (2014), pp. 389–403.
  • A.P. Santhakumaran and M. Mahendran, The open monophonic number of a graph, Int. J. Sci. Eng. Res. 5(2) (2014), pp. 1644–1649.
  • A.P. Santhakumaran and M. Mahendran, The total open monophonic number of a graph, J. Adv. Math. 9(3) (2014), pp. 2099–2107.
  • A.P. Santhakumaran and M. Mahendran, The forcing open monophonic number of a graph, Proyeccion. J. Math. 35(1) (2016), pp. 65–81.
  • A.P. Santhakumaran, P. Titus, and K. Ganesamoorthy, On the monophonic number of a graph, J. Appl. Math. Inf. 32(1–2) (2014), pp. 255–66.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.