Triangle-free projective-planar graphs with diameter two: domination and characterization
Combinatorics
2022-12-09 v1 Discrete Mathematics
Abstract
In 1975, Plesn\'ik characterized all triangle-free planar graphs as having a diameter . We characterize all triangle-free projective-planar graphs having a diameter and discuss some applications. In particular, the main result is applied to calculate the analogue of clique numbers for graphs, namely, colored mixed graphs, having different types of arcs and edges.
Keywords
Cite
@article{arxiv.2212.04253,
title = {Triangle-free projective-planar graphs with diameter two: domination and characterization},
author = {Dibyayan Chakraborty and Sandip Das and Srijit Mukherjee and Uma kant Sahoo and Sagnik Sen},
journal= {arXiv preprint arXiv:2212.04253},
year = {2022}
}