scientific article; zbMATH DE number 3997850
The author introduces the notion of a cordial labelling of a finite nondirected graph \(G=(V,E)\) without loops and multiple edges by defining: A labelling f of G with \(F: V\to \{0,1\}\) and with the induced edge- labelling \[ \bar f: \begin{cases} E\to \bar N=\{0,1\} \\ \{u,v\} \to | f(u)-f(v)| \end{cases} \] is said to be a cordial labelling of G if, and only if, \(| v_ f(1)- v_ f(0)| \leq 1\), \(| e_{\bar f}(1)-e_{\bar f}(0)| \leq 1\), where \(v_ f(i)\) and \(e_{\bar f}(i)\), \(i=0,1\), is the number of vertices and edges of G, respectively, with label i (under f and \(\bar f,\) respectively). It is clear that there is a relationship between cordial graphs and graceful (harmonious) graphs. So the author demonstrates this relationship by proving that any graceful (harmonious) tree is cordial. Although he proves that every tree is cordial he isn't able to determine the set of cordial graphs. Therefore he has to restrict himself to the determination of several special families of graphs having a cordial labelling.
- A-cordial graphs
- Cordial labeling of \(mK_ n\)
- (Di)graph products, labelings and related results
- A new approach in finding full friendly indices
- NEPS operations on cordial graphs
- On cordial and balanced labelings of graphs
- The cordiality of the path-union of \(n\) copies of a graph
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- On some graph-cordial abelian groups
- Rainbow spanning trees in abelian groups
- On 3-total edge product cordial labeling of a carbon nanotube network
- 3-total edge product cordial labeling of rhombic grid
- Difference cordiality of product related graphs
- On \(3\)-total edge product cordial labeling of honeycomb
- Labeling constructions using digraph products
- Some new results on prime cordial labeling
- Cordial deficiency
- Uniformly cordial graphs
- The cordiality of the sum and union of two fourth power of paths and cycles
- On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels
- Cordial sets of hypercubes
- Cordial labeling of degree splitting graphs
- Hypo-k-totally magic cordial labeling of graphs
- On the cordiality of D(1,3) graphs.
- Cordially of the complete graphs
- Study of some problems of cordial graphs
- scientific article; zbMATH DE number 1802822 (Why is no real title available?)
- Fully cordial trees
- Graceful and cordial labeling of subdivision of graphs
- 3-product cordial labeling of some snake graphs
- 3-difference cordiality of some corona graphs
- Further results on 3-product cordial labeling
- Quotient-3 cordial labeling for path related graphs. II
- On friendly index sets of the edge-gluing of complete graph and cycles
- On full friendly index sets of 1-level and 2-levels N-grids
- scientific article; zbMATH DE number 4210188 (Why is no real title available?)
- scientific article; zbMATH DE number 4214058 (Why is no real title available?)
- Various results on graph labelings
- scientific article; zbMATH DE number 5307941 (Why is no real title available?)
- scientific article; zbMATH DE number 4099377 (Why is no real title available?)
- Full friendly index set. I
- Cordial labeling of hypertrees
- scientific article; zbMATH DE number 19195 (Why is no real title available?)
- scientific article; zbMATH DE number 54791 (Why is no real title available?)
- Some new standard graphs labeled by 3-total edge product cordial labeling
- scientific article; zbMATH DE number 7008862 (Why is no real title available?)
- \(k\)-quotient cordial labeling of graphs
- On 3-total edge product cordial connected graphs
- Product cordial labeling of double wheel and double fan related graphs
- Labeling subgraph embeddings and cordiality of graphs
- 3-divisor cordiality of some product related graphs
- Path-cordial abelian groups
- On 3-total edge product cordial labeling of grid
- All trees are six-cordial
- On friendly index sets of k-galaxies
- On total edge product cordial labeling of fullerenes
- Group S_{3} Cordial Remainder Labeling for Path and Cycle related Graphs
- On friendly index and product-cordial index sets of Möbius-liked graph
- On cordial related labeling of isomorphic copies of paths and subdivision of star
- Full-edge friendly index sets of fan
- Intersection cordiality of union of some standard graphs
- ON FIBONACCI PRODUCT CORDIAL LABELING IN CONTEXT OF VERTEX SWITCHING OF GRAPHS
- scientific article; zbMATH DE number 7509360 (Why is no real title available?)
- SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS
- DIVISOR CORDIAL LABELING OF GRAPHS IN THE CONTEXT OF SOME GRAPH OPERATIONS
- PRIME CORDIAL LABELING FOR SOME PATH, CYCLE AND WHEEL RELATED GRAPHS
- scientific article; zbMATH DE number 7528092 (Why is no real title available?)
- \(k\)-product cordial behaviour of union of graphs
- Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
- scientific article; zbMATH DE number 7587198 (Why is no real title available?)
- On edge product cordial graphs
- Group \(S_3\) cordial remainder labeling of subdivision of graphs
- scientific article; zbMATH DE number 7296912 (Why is no real title available?)
- Equivalencies of cordial labeling and sum divisor cordial labeling
- On \(Z_2\times Z_2\)-cordial labelling of graphs
- Group \(\{1, -1, i, -i\}\) cordial labeling of special graphs
- 4-remainder cordial labeling of some new families graphs
- Some 4-total prime cordial labeling of graphs
- On signed cordial graph
- scientific article; zbMATH DE number 4187864 (Why is no real title available?)
- Klein cordial trees and odd cyclic cordial friendship graphs
- scientific article; zbMATH DE number 7708012 (Why is no real title available?)
- Neighborhood balanced colorings of graphs
- Group S₃ mean cordial labeling for star related graphs
- Some new results on power cordial labeling
- DIVISOR CORDIAL LABELING FOR SOME SNAKES AND DEGREE SPLITTING RELATED GRAPHS
- Cordial Labeling of Corona Product between Paths and Fourth Power of Paths
- ENERGY OF FIBONACCI PRODUCT CORDIAL GRAPH
- Jacobi symbol cordial labeling and Jacobi symbol 3-equitable labeling of digraphs
- \(k\)-product cordial labeling of product of graphs
- Cordial forests
- Pair difference cordiality of certain subdivision graphs
- Power cordial graphs
- The cordiality game and the game cordiality number
- On the number of unlabeled vertices in edge-friendly labelings of graphs
- Cordial digraphs
- (2, 3)-cordial trees and paths
- (2, 3)-cordial oriented hypercubes
- Multiply divisor cordial labeling in context of joint sum of graphs
- Total balanced antimagic labeling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724671)