Year: 2025
Type: article
Abstract: Let be a simple connected graph. For any set , the S-radial set, , is defined as the set of vertices which are at a radial distance from some vertex . The Max-radial number of G is defined as and it is denoted by . In this paper, we characterize the family of trees with extreme and almost extreme max-radial number. Also, we investigate how this parameter varies with other graph parameters and obtain some interesting results.
Author: M. Mathan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4414332965
FWCI:
Cites:
Cited by:
Related to: