Advanced search
Publication Cover
International Journal of Computer Mathematics: Computer Systems Theory Volume 8, 2023 - Issue 1: Special Issue on 27th International Computing and Combinatorics Conference (Selected Papers from COCOON 2021) - Part II; Guest Editors: Wing-Kai Hon, Ling-Ju Hung, and Chia-Wei Lee
Submit an article Journal homepage
40
Views
0
CrossRef citations to date
0
Altmetric
27th International Computing and Combinatorics Conference (Selected Papers from COCOON 2021)

The upper connected outer connected monophonic number of a graph

K. Ganesamoorthya Department of Mathematics, Coimbatore Institute of Technology, Coimbatore, IndiaCorrespondence[email protected]
&
S. Lakshmi Priyab Department of Mathematics, CIT Sandwich Polytechnic College, Coimbatore, India
Pages 57-66 | Received 28 Jan 2022, Accepted 15 Feb 2023, Published online: 20 Mar 2023

References

  • F. Buckley, and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
  • 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. Electron. 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.
  • K. Ganesamoorthy, and D. Jayanthi, Further results on the outer connected geodetic number of a graph. Publi. de l’Institut Math. 108(122) (2020), pp. 79–89.
  • K. Ganesamoorthy, and D. Jayanthi, On the outer connected geodetic number of a graph. Trans. Natl. Acad. Sci. Azerb. Ser. Phys.-Tech. Math. Sci. Math. 41(1) (2021), pp. 78–84.
  • K. Ganesamoorthy, and D. Jayanthi, The outer connected geodetic number of a graph. Proc. Natl. Acad. Sci. India Sect. A Phys. Sci. 91 (2021), pp. 195–200.
  • K. Ganesamoorthy, and D. Jayanthi, More on the outer connected geodetic number of a graph. Discrete Math. Algorithms Appl. 2250128 (2022). doi:10.1142/S1793830922501282.
  • K. Ganesamoorthy, and D. Jayanthi, The upper and forcing connected outer connected geodetic numbers of a graph. J. Interconnect. Netw. 22(1) (2022), pp. 2142022. doi:10.1142/S0219265921420226.
  • K. Ganesamoorthy, and S. Lakshmi Priya, The outer connected monophonic number of a graph. Ars Comb. 153 (2020), pp. 149–160.
  • K. Ganesamoorthy, and S. Lakshmi Priya, Further results on the outer connected monophonic number of a graph. Trans. Natl. Acad. Sci. Azerb. Ser. Phys.-Tech. Math. Sci. Math. 41(4) (2021), pp. 51–59.
  • K. Ganesamoorthy, and S. Lakshmi Priya, Extreme outer connected monophonic graphs. Commun. Comb Optim. 7(2) (2022), pp. 211–226.
  • K. Ganesamoorthy, and S. Lakshmi Priya, Forcing total outer connected monophonic number of a graph. Izv. Saratov Univ. Math. Mech. Inform. 22(3) (2022), pp. 278–286.
  • K. Ganesamoorthy, and S. Lakshmi Priya, Minimal outer connected monophonic sets in graphs. Acta Math. Universitatis Comenianae 91(4) (2022), pp. 301–312.
  • K. Ganesamoorthy, and S. Lakshmi Priya, The total outer connected monophonic number of a graph. Trans. A. Razmadze Math. Inst., accepted.
  • F. Harary, Graph Theory, Addision-Wesely, Massachusetts, 1969.
  • 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 K. Ganesamoorthy, Restrained double monophonic number of a graph. Ural Math. J. 5(2) (2019), pp. 55–63.
  • A.P. Santhakumaran, and P. Titus, Monophonic distance in graphs. Discrete Math. Algorithms Appl. 03(2) (2011), pp. 159–169.
  • A.P. Santhakumaran, and P. Titus, A note on “monophonic distance in graphs”. Discrete Math. Algorithms Appl. 4(2) (2012). doi:10.1142/S1793830912500188.
  • 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–266.
  • P. Titus, and K. Ganesamoorthy, The connected monophonic number of a graph. Graphs Comb. 30 (2014), pp. 237–245.

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.