Mathematics and Statistics Vol. 11(3), pp. 441 - 445
DOI: 10.13189/ms.2023.110301
Reprint (PDF) (498Kb)


Steiner Antipodal Number of Graphs Obtained from Some Graph Operations


R. Gurusamy *, A. Meena Kumari , R. Rathajeyalakshmi
Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi- 626 005, Tamilnadu, India

ABSTRACT

The Steiner p-antipodal graph of a connected graph G, has vertex set like G and p number of vertices are adjacent to each other in whenever they are p-antipodal in G. If G has more than one component, then p vertices are adjacent to each other in if at least one vertex from different components. Draw Kp related to p-antipodal vertices in . The Steiner antipodal number of a graph G is the smallest natural number p, so that the Steiner p-antipodal graph of G is complete. In this article, Steiner antipodal number has been determined for the generalized corona of graphs and for each natural number p≥2, we can construct many non-isomorphic graphs of order p having Steiner antipodal number p. Also for any pair of natural numbers l,m ≥ 3 with l ≤ m, there is a graph whose Steiner antipodal number is l and Steiner antipodal number of its line graph is m. For every natural number p≥1, there is a graph G whose complement has Steiner antipodal number p.

KEYWORDS
Steiner n-eccentricity, Steiner Antipodal Number, Generalized Corona of Graphs, Line Graph, Complement Graph

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] R. Gurusamy , A. Meena Kumari , R. Rathajeyalakshmi , "Steiner Antipodal Number of Graphs Obtained from Some Graph Operations," Mathematics and Statistics, Vol. 11, No. 3, pp. 441 - 445, 2023. DOI: 10.13189/ms.2023.110301.

(b). APA Format:
R. Gurusamy , A. Meena Kumari , R. Rathajeyalakshmi (2023). Steiner Antipodal Number of Graphs Obtained from Some Graph Operations. Mathematics and Statistics, 11(3), 441 - 445. DOI: 10.13189/ms.2023.110301.