"On clique numbers of colored mixed graphs" by Dipayan Chakraborty, Sandip Das et al.
 

On clique numbers of colored mixed graphs

Article Type

Research Article

Publication Title

Discrete Applied Mathematics

Abstract

An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency; and the type and direction of the adjacency. An (m,n)-relative clique of G is a vertex subset R whose images are always distinct under any homomorphism of G to any H. The maximum cardinality of an (m,n)-relative clique of a graph is called the (m,n)-relative clique number of the graph. In this article, we explore the (m,n)-relative clique numbers for three different families of graphs, namely, graphs having bounded maximum degree Δ, subcubic graphs, partial 2-trees and planar graphs and provide tight or close bounds in most cases.

First Page

29

Last Page

40

DOI

https://10.1016/j.dam.2022.08.013

Publication Date

1-15-2023

Comments

Open Access, Green

Link to Full Text

Share

COinS