The cordiality of the path-union of n copies of a graph
From MaRDI portal
Publication:1916396
Recommendations
Cites work
Cited in
(22)- scientific article; zbMATH DE number 5844223 (Why is no real title available?)
- One vertex union of shell graphs with a path at any common level is cordial
- On the cordiality of \(D(1,3)\) graphs.
- Vertex equitable labeling of union of cyclic snake related graphs
- NEPS operations on cordial graphs
- Uniformly cordial graphs
- scientific article; zbMATH DE number 2174621 (Why is no real title available?)
- On friendly index sets of 2-regular graphs
- The cordiality of one-point union of \(n\) copies of a graph
- \(Z_k\)-magic labeling of path union of graphs
- The corona between cycles and paths
- scientific article; zbMATH DE number 2197924 (Why is no real title available?)
- One point union of paths of cycles and their \(k\)-numbers
- \(L(3, 2, 1)\)-labeling of banana trees
- On cordiality of one point unions and one edge unions of some classes of graphs
- Some results on specific graphs.
- Graph operations and cordiality.
- Cordialness of cycles with parallel \(P_k\)-chords and multiple subdivision graphs
- SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS
- Some new results on global dominating sets
- Some cordial graphs in the context of barycentric subdivision
- The corona between paths and cycles.
This page was built for publication: The cordiality of the path-union of \(n\) copies of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916396)