Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.04458 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917941977546752 |
|---|---|
| author | Brahmbhatt, Anand Rai, Kartikeya Tripathi, Amitabha |
| author_facet | Brahmbhatt, Anand Rai, Kartikeya Tripathi, Amitabha |
| contents | A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the label $|f(x)-f(y)|$, the number of edges labelled $0$ and the number of edges labelled $1$ also differ at most by $1$. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_04458 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Measures of closeness to cordiality for graphs Brahmbhatt, Anand Rai, Kartikeya Tripathi, Amitabha Combinatorics 05C78 A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the label $|f(x)-f(y)|$, the number of edges labelled $0$ and the number of edges labelled $1$ also differ at most by $1$. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs. |
| title | Measures of closeness to cordiality for graphs |
| topic | Combinatorics 05C78 |
| url | https://arxiv.org/abs/2411.04458 |