Distance compatible set-labeling of graphs

MaRDI QIDQ2905858zbMATH OpenFDO

Authors Bindhu K. Thomas, K. A. Germina

Publication date 28 August 2012

Published in International Mathematical Forum (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/imf-2011/29-32-2011/index.html

zbMATH Keywords

1-uniform dcsl index1-uniform distance compatible set-labeling\(k\)-distance compatible set-labeling of graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Distance compatible set-labeling index of graphs
• Uniform distance-compatible set-labelings of graphs
• Friendship-Like Graphs and It’s Classiffication
• (k,r)-arithmetic distance compatible set-labeling of graphs
• Some classes of dispersible dcsl-graphs

Cited in

(11)

• Distance compactible set labeled graphs and friendship hypergraphs
• Characterization of vertex labeling of 1-uniform dcsl graph which form a lattice
• (k,r)-arithmetic distance compatible set-labeling of graphs
• Distance compatible set-labeling index of graphs
• Uniform distance-compatible set-labelings of graphs
• Constructions of 1-uniform dcsl graphs using well-graded families of sets
• Characterization of 1-uniform dcsl graphs and well graded family of sets
• Some classes of dispersible dcsl-graphs
• Graph distance‐dependent labeling related to code assignment in computer networks
• Learning graphs and 1-uniform dcsl graphs
• On the dimension of vertex labeling of k-uniform dcsl of k-uniform caterpillar

This page was built for publication: Distance compatible set-labeling of graphs

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