### Forcing vertex square free detour number of a graph

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

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.

Ramalingam, S. S., Asir, I. K., &Athisayanathan, S. (2017). Upper Vertex Triangle Free Detour Number of a Graph. Mapana Journal of Sciences, 16(3), 27-40.

Ramalingam, S. Sethu, I. Keerthi Asir, and S. Athisayanathan. Vertex Triangle Free Detour Number of a Graph. Mapana Journal of Sciences 15.3 (2016): 9-24.

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

DOI: http://dx.doi.org/10.23755/rm.v45i0.1030

### Refbacks

- There are currently no refbacks.

Copyright (c) 2023 G Priscilla Pacifica, K Christy Rani

This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.