{
  "id": "2104.07416",
  "version": "v1",
  "published": "2021-04-15T12:29:52.000Z",
  "updated": "2021-04-15T12:29:52.000Z",
  "title": "On clique numbers of colored mixed graphs",
  "authors": [
    "Dipayan Chakraborty",
    "Sandip Das",
    "Soumen Nandi",
    "Debdeep Roy",
    "Sagnik Sen"
  ],
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "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, the type thereto and the direction. A subset R of the set of vertices of G that always maps distinct vertices in itself to distinct image vertices under any homomorphism is called an (m,n)-relative clique of G. 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 various families of graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-04-15T12:29:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "clique number",
      "colored mixed graphs",
      "maps distinct vertices",
      "distinct image vertices",
      "preserves adjacency"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}