The Circular Number of a Graph

Dimensions

Sheeja, S. and Rajendran, K. (2024) The Circular Number of a Graph. Advances in Nonlinear Variational Inequalities, 28 (1s). pp. 293-298. ISSN 1092-910X

[thumbnail of Sheeja+_ANVI_Circular_Number_of_a_graph_Journal.pdf]

Text
Sheeja+_ANVI_Circular_Number_of_a_graph_Journal.pdf
Download (515kB)

Official URL: https://doi.org/10.52783/anvi.v28.2338

Abstract

The Circular Number of a Graph S. Sheeja

If I_c [S]=V(G), then a set S⊆V (G) is a circular set of G. The circular number of G, represented by cr(G), is the lowest cardinality of a circular set of G. A cr-set of G is any circular set with cardinality cr(G). In this study, we determine the circular number of certain standard graphs. It is demonstrated that there exists a connected graph G such that dn(G)=a, g(G)=b and cr(G)=c for each integer a,b, and c with a>2,b>2, and c>2. The corona of graphs and circular number of joins were also explored.
11 14 2024 293 298 10.52783/anvi.v28.2338 https://internationalpubls.com/index.php/anvi/article/view/2338 https://internationalpubls.com/index.php/anvi/article/download/2338/1432 https://internationalpubls.com/index.php/anvi/article/download/2338/1432

Item Type:	Article
Subjects:	Mathematics > Graph Theory
Domains:	Mathematics
Depositing User:	Mr IR Admin
Date Deposited:	14 Aug 2025 06:15
Last Modified:	14 Aug 2025 06:15
URI:	https://ir.vistas.ac.in/id/eprint/9948

Actions (login required)

: View Item