Outer independent square free detour number of a graph

K Christy Rani; G Pricilla Pacifica

doi:10.23755/rm.v44i0.919

Ratio Mathematica (Dec 2022)

Outer independent square free detour number of a graph

K Christy Rani,
G Pricilla Pacifica

Affiliations

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
Journal volume & issue: Vol. 44, no. 0
pp. 309 – 315

Abstract

Read online

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

Published in Ratio Mathematica

ISSN: 1592-7415 (Print); 2282-8214 (Online)
Publisher: Accademia Piceno Aprutina dei Velati
Country of publisher: Italy
LCC subjects: Science: Mathematics: Probabilities. Mathematical statistics
Website: http://eiris.it/ojs/index.php/ratiomathematica/index

About the journal

Abstract

Keywords