On Proper Diameter of Certain Classes of Graphs

Title

On Proper Diameter of Certain Classes of Graphs

Creator

Deepika, H.R.; Mangam, T.A.

Description

An edge coloring of a graph is said to be proper edge coloring if no two adjacent edges receive the same color. A graph G is said to be properly connected if there exists a properly edge colored path between every pair of vertices. For a properly connected graph G with a k-edge coloring c, the proper diameter of a graph, pdiamk (G) is the maximum proper distance between any distinct pair of vertices in G. We investigate the proper diameter of various classes of graphs that are 2-colored and provide bounds on the values of pdiam2(G) for these graphs. Palestine Polytechnic University-PPU 2025.

Source

Palestine Journal of Mathematics;Volume;14;Issue;2;pp.1-11

Date

01-01-2025

Publisher

Palestine Polytechnic University

Subject

Proper connectivity; Proper diameter

Coverage

Deepika H.R., Department of Mathematics, CHRIST (Deemed to be University), India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), India

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 22195688;

Format

online

Language

English

Type

Article

Identifier

https://www.scopus.com/pages/publications/105007465964?origin=resultslist