AI Chat AI Image Generator AI Video Text to Speech

Triangle-free projective-planar graphs with diameter two: domination and characterization

12/08/2022

∙

by Dibyayan Chakraborty, et al.

∙

∙

In 1975, Plesník characterized all triangle-free planar graphs as having a diameter 2. We characterize all triangle-free projective-planar graphs having a diameter 2 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.

Dibyayan Chakraborty
13 publications
Sandip Das
23 publications
Srijit Mukherjee
1 publication
Uma kant Sahoo
3 publications
Sagnik Sen
16 publications

page 1

page 2

page 3

page 4

research

∙ 08/17/2017

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count

We show that triangle-free penny graphs have degeneracy at most two, lis...

0 David Eppstein, et al. ∙

research

∙ 10/19/2021

Eternal Domination and Clique Covering

We study the relationship between the eternal domination number of a gra...

0 Gary MacGillivray, et al. ∙

research

∙ 05/03/2023

The independence ratio of 4-cycle-free planar graphs

We prove that every n-vertex planar graph G with no triangle sharing an ...

0 Tom Kelly, et al. ∙

research

∙ 02/08/2019

Flexibility of triangle-free planar graphs

Let G be a planar graph with a list assignment L. Suppose a preferred co...

0 Zdeněk Dvořák, et al. ∙

research

∙ 08/31/2022

Complexity of diameter on AT-free graphs is linear

We exploit properties of dominating pair sets (polar pairs) in asteroida...

0 Oleksiy Al-Saadi, et al. ∙

research

∙ 08/22/2022

The oriented relative clique number of triangle-free planar graphs is 10

In relation to oriented coloring and chromatic number, the parameter ori...

0 Soura Sena Das, et al. ∙

research

∙ 10/27/2017

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on gra...

0 A. Bonato, et al. ∙