On friendly index sets of 2-regular graphs

DOI10.1016/J.DISC.2007.10.018zbMATH Open1163.05026OpenAlexW2096054909MaRDI QIDQ998432FDOQ998432

Authors: Harris Kwong, Ho Kuen Ng, Sin-Min Lee 

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.018

Recommendations

• On friendly index sets of bipartite graphs
• On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels
• scientific article; zbMATH DE number 7085085
• Product-cordial index and friendly index of regular graphs
• On friendly index sets of prisms and Möbius ladders

zbMATH Keywords

cyclefriendly index setcordialityfriendly labelingvertex labeling2-regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• A-cordial graphs
• On friendly index sets of bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The computational complexity of cordial and equitable labelling
• Uniformly cordial graphs
• Title not available (Why is that?)
• The cordiality of one-point union of \(n\) copies of a graph
• Cordial labeling of \(mK_ n\)
• On cordial and balanced labelings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• NEPS operations on cordial graphs
• The cordiality of the path-union of \(n\) copies of a graph
• Title not available (Why is that?)

Cited In (16)

• On friendly index and product-cordial index sets of Möbius-liked graph
• Product-cordial index and friendly index of regular graphs
• On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels
• Title not available (Why is that?)
• On friendly index sets of bipartite graphs
• Labeling subgraph embeddings and cordiality of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Full edge-friendly index sets of complete bipartite graphs
• 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
• Full friendly index set. I
• Full-edge friendly index sets of fan
• Title not available (Why is that?)
• On friendly index sets of \(k\)-galaxies
• On friendly index sets of total graphs of trees

This page was built for publication: On friendly index sets of 2-regular graphs

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