Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On friendly index and product-cordial index sets of Möbius-liked graph

From MaRDI portal
Publication:5031885
Jump to:navigation, search

DOI10.1080/09720529.2016.1220089zbMath1481.05135OpenAlexW2804673113MaRDI QIDQ5031885

Zhen-Bin Gao, Sin Min Lee, Gee-Choon Lau

Publication date: 16 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2016.1220089


zbMATH Keywords

friendly index setfriendly labelingMöbius-liked graphproduct-cordial index sets


Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of design theory to circuits and networks (94C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial codes (94B25)


Related Items (1)

Full-edge friendly index sets of fan




Cites Work

  • On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels
  • On friendly index sets of the edge-gluing of complete graph and cycles
  • On friendly index sets of 2-regular graphs
  • A new approach in finding full friendly indices
  • On graph labeling parameters
  • On the Möbius Ladders
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: On friendly index and product-cordial index sets of Möbius-liked graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5031885&oldid=19501167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki