The cordiality of one-point union of n copies of a graph
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- On cordiality of one point unions and one edge unions of some classes of graphs
- Uniformly cordial graphs
- scientific article; zbMATH DE number 7687430 (Why is no real title available?)
- Cordial labeling of \(mK_ n\)
- On vertex Euclidean deficiency of one-point union and one-edge union of complete graphs
- On friendly index sets of 2-regular graphs
- Betweenness centrality in convex amalgamation of graphs
- EDGECUT POLYNOMIAL OF GRAPHS
- On total edge product cordial labeling of fullerenes
- scientific article; zbMATH DE number 94970 (Why is no real title available?)
- The cordiality of the path-union of \(n\) copies of a graph
- A totally magic cordial labeling of one-point union of n copies of a graph
- On friendly index sets of the edge-gluing of complete graph and cycles
- scientific article; zbMATH DE number 5844223 (Why is no real title available?)
- On 3-total edge product cordial labeling of a carbon nanotube network
- 3-total edge product cordial labeling of rhombic grid
- On \(3\)-total edge product cordial labeling of honeycomb
- One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
- scientific article; zbMATH DE number 6988912 (Why is no real title available?)
This page was built for publication: The cordiality of one-point 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 Q686170)
