The cordiality of one-point union of n copies of a graph
From MaRDI portal
Publication:686170
DOI10.1016/0012-365X(93)90337-SzbMATH Open0781.05045MaRDI QIDQ686170FDOQ686170
Publication date: 9 November 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Study of some problems of cordial graphs
- The cordiality of the path-union of \(n\) copies of a graph
- Cordial labeling for the sum and union of the second power of paths and stars
- [[:Publication:3358767|Title not available (Why is that?)]]
- [[:Publication:4020464|Title not available (Why is that?)]]
Cites Work
Cited In (18)
- Uniformly cordial graphs
- Title not available (Why is that?)
- 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
- EDGECUT POLYNOMIAL OF GRAPHS
- On total edge product cordial labeling of fullerenes
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
