Some Aspects of Radial Graphs Under Boolean Operations

Two vertices of a graph $G$ are said to be radial to each other if the distance between them is equal to the radius of the graph. The radial graph of a graph $G,$ denoted by $R(G),$ has the vertex set as in $G$ and two vertices are adjacent in $R(G)$ if and only if they are radial to each other in $...

Full description

Saved in:
Bibliographic Details
Published in:Communications in Mathematics and Applications 2024-01, Vol.15 (1), p.185-190
Main Authors: Vetriselvi, S., Sangeetha, G.
Format: Article
Language:English
Subjects:
Apexes
Graph theory
Graphs
Vertex sets
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two vertices of a graph $G$ are said to be radial to each other if the distance between them is equal to the radius of the graph. The radial graph of a graph $G,$ denoted by $R(G),$ has the vertex set as in $G$ and two vertices are adjacent in $R(G)$ if and only if they are radial to each other in $G.$ If $G$ is disconnected, then the two vertices are adjacent in $R(G)$ if they belong to different components of $G.$ The main objective of this paper is to determine the radial graphs of some families of product graphs.
ISSN:0976-5905
0975-8607
DOI:10.26713/cma.v15i1.2122