Klein cordial trees and odd cyclic cordial friendship graphs

DOI10.1016/J.DISC.2023.113488MaRDI QIDQ6098079zbMATH OpenOpenAlexFDO

Authors

Publication date 12 June 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2211.10044

zbMATH Keywords

cordial labelingsfriendship graphsMAD pairstrees

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are as evenly distributed as possible. Much work has since been done with trees, hypertrees, paths, cycles, ladders, prisms, hypercubes, and bipartite graphs. In this paper we show that all trees are $mathbb{Z}_2^2$-cordial except for $P_4$ and $P_5$. In addition, we give numerous results relating to $mathbb{Z}_m$-cordiality of the friendship graph $F_n$. The most general result shows that when $m$ is an odd multiple of $3$, then $F_n$ is $mathbb{Z}_m$-cordial for all $n$. We also give a general conjecture to determine when $F_n$ is $mathbb{Z}_m$-cordial.

Recommendations

• A-cordial graphs
• On friendly index sets of total graphs of trees
• On some graph-cordial abelian groups
• Generalized graph cordiality
• Path-cordial abelian groups

Cites work

• \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
• A dynamic survey of graph labeling
• A-cordial graphs
• All trees are six-cordial
• Cordial labeling of hypertrees
• Generalized graph cordiality
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On cordial labeling of hypertrees
• On some graph-cordial abelian groups
• Path-cordial abelian groups
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• Sets in Abelian groups with distinct sums of pairs.
• The computational complexity of cordial and equitable labelling

Cited in

(9)

• A-cordial graphs
• On some graph-cordial abelian groups
• Fully cordial trees
• Generalized graph cordiality
• Path-cordial abelian groups
• All trees are six-cordial
• On \(Z_2\times Z_2\)-cordial labelling of graphs
• E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees
• Binary vertex labelings of graphs and digraphs

This page was built for publication: Klein cordial trees and odd cyclic cordial friendship graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098079)