The Total Circular Number of Graphs
Abstract
Let G=(V,E) be a connected graph with at least two vertices. A set S⊆,V(G) is called a total circular set of G if S is a circular set of G and the subgraph G[S] induced by S has no isolated vertex. The total circular number tcr(G) of G is the minimum order of its total circular sets and any total circular set of order tcr(G) is called a tcr-set of G. In this article, the total circular number of some standard graphs are determined.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Graph theory and applications
Publication details
- Journal / source
- International Journal of Science and Research (IJSR)
- Pages
- 46–49
- Publication date
- 3 March 2026
- Language
- EN