Word-representability of co-bipartite graph
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912192289308672 |
|---|---|
| author | Das, Biswajit Hariharasubramanian, Ramesh |
| author_facet | Das, Biswajit Hariharasubramanian, Ramesh |
| contents | A graph $G = (V, E)$ is word-representable, if there exists a word $w$ over the alphabet $V$ such that for letters $\{x,y\}\in V$, $x$ and $y$ alternate in $w$ if and only if $xy \in E$. A graph is co-bipartite if its complement is a bipartite graph. Therefore, the vertex set of a co-bipartite graph can be partitioned into two disjoint cliques.
The concept of word-representability for co-bipartite graphs has not yet been fully studied. In the book Words and Graphs written by Sergey Kitaev and Vadim Lozin, examples of co-bipartite graphs that are not word-representable are provided. The authors have stated that it remains an open problem to characterize word-representable co-bipartite graphs. It is known that taking the complement of word-representable graphs does not preserve their word-representability. In this paper, we first identify certain classes of bipartite graphs for which word-representation is preserved after the complement operation. We found that the complement of the path graphs, even cycle graphs and generalized crown graphs are also word-representable. Next, we aim to find word-representable co-bipartite graphs in which the size of one clique partition is fixed while the other one can vary. We studied the word-representability of co-bipartite graphs where the sizes of one clique partition are $2$ and $3$. We found that any co-bipartite graphs where the size of the one clique partition is $2$ are word-representable. Also, when the size of the one clique partition is $3$, we found certain co-bipartite graphs are word-representable. Additionally, for word-representable graphs, it has been established that a graph is word-representable if and only if it can be oriented in a specific manner, known as semi-transitive orientation. We provide the necessary and sufficient conditions for a co-bipartite graph to have a semi-transitive orientation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_10112 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Word-representability of co-bipartite graph Das, Biswajit Hariharasubramanian, Ramesh Combinatorics A graph $G = (V, E)$ is word-representable, if there exists a word $w$ over the alphabet $V$ such that for letters $\{x,y\}\in V$, $x$ and $y$ alternate in $w$ if and only if $xy \in E$. A graph is co-bipartite if its complement is a bipartite graph. Therefore, the vertex set of a co-bipartite graph can be partitioned into two disjoint cliques. The concept of word-representability for co-bipartite graphs has not yet been fully studied. In the book Words and Graphs written by Sergey Kitaev and Vadim Lozin, examples of co-bipartite graphs that are not word-representable are provided. The authors have stated that it remains an open problem to characterize word-representable co-bipartite graphs. It is known that taking the complement of word-representable graphs does not preserve their word-representability. In this paper, we first identify certain classes of bipartite graphs for which word-representation is preserved after the complement operation. We found that the complement of the path graphs, even cycle graphs and generalized crown graphs are also word-representable. Next, we aim to find word-representable co-bipartite graphs in which the size of one clique partition is fixed while the other one can vary. We studied the word-representability of co-bipartite graphs where the sizes of one clique partition are $2$ and $3$. We found that any co-bipartite graphs where the size of the one clique partition is $2$ are word-representable. Also, when the size of the one clique partition is $3$, we found certain co-bipartite graphs are word-representable. Additionally, for word-representable graphs, it has been established that a graph is word-representable if and only if it can be oriented in a specific manner, known as semi-transitive orientation. We provide the necessary and sufficient conditions for a co-bipartite graph to have a semi-transitive orientation. |
| title | Word-representability of co-bipartite graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.10112 |