Outer independent square free detour number of a graph

Authors

  • K Christy Rani Department of Mathematics, St. Mary’s College (Autonomous), Thoothukudi-628 001, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627 012, India;
  • G Pricilla Pacifica Department of Mathematics, St. Mary’s College (Autonomous), Thoothukudi-628001, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627012, India;

DOI:

https://doi.org/10.23755/rm.v44i0.919

Keywords:

square free detour set, outer independent square free detour set, outer independent square free detour number.

Abstract

For a connected graph , a set  of vertices is called an outer independent square free detour set if   is a square free detour set of  such that either  or is an independent set. The minimum cardinality of an outer independent square free detour set of  is called an outer independent square free detour number of  and is denoted by  We determine the outer independent square free detour number of some graphs. We characterize the graph which realizes the result that for any pair of integers  and  with there exists a connected graph  of order  with square free detour number and outer independent square free detour number  

References

Asir, I. Keerthi, and S. Athisayanathan. Triangle free detour distance in graphs. J. Combin. Math. Combin. Comput 105 (2016).

Chartrand, Gary, Garry L. Johns, and Songlin Tian. Detour distance in graphs. Annals of discrete mathematics. Vol. 55. Elsevier (1993): 127-136.

Chartrand, Garry L. Johns and Ping Zhang. The detour number of a graph. Util. Math. 64, (2003): 97-113.

Christy Rani K. and Priscilla Pacifica G. Square free detour number of some derived graphs. Proceedings of International conference on recent trends in mathematics and its applications (2022): 978-93-5680-181-3: 48-52.

Jalaei, R., and D. A. Mojdeh. Outer independent double Italian domination: Complexity, characterization. Discrete Mathematics, Algorithms and Applications (2022): 2250085.

John, J., and N. Ariyanayagam. The detour domination number of a graph. Discrete mathematics, algorithms and applications 9.01 (2017): 149-170.

Santhakumaran, A. P., and S. Athisayanathan. On the connected detour number of a graph. Journal of Prime research in Mathematics 5 (2009): 149-170.

Sethu Ramalingam, S., and S. Athisayanathan. Upper triangle free detour number of a graph. Discrete Mathematics, Algorithms and Applications 14.01 (2022): 2150094.

Downloads

Published

2022-12-11

Issue

Vol. 44 (2022): Special Issue: Recent Trends in Mathematics and its Applications

Section

Volume 45-2023

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.