Work

Connectivity of 3-distance graphs

Year: 2025

Type: article

Abstract: For a simple graph [Formula: see text], the [Formula: see text]-distance graph, [Formula: see text], is a graph with the vertex set [Formula: see text] and two vertices are adjacent if and only if the distance between them is [Formula: see text] in the graph [Formula: see text]. For a connected graph [Formula: see text], we provide some conditions for the connectedness of [Formula: see text]. Also, we characterize all trees and unicyclic graphs with connected [Formula: see text]-distance graphs.

Source: Asian-European Journal of Mathematics

DOI: 10.1142/s179355712550038x

Authors: S. R. Musawi, S. H. Jafari

Institution: University of Shahrood

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4408951223

FWCI:

Cites: 5

Cited by:

Related to: 10