DIMENSION OF VERTEX LABELING OF k-UNIFORM dcsl PATH

DOI10.17654/AADMOct2015_089_109zbMath1338.05236OpenAlexW2520761776MaRDI QIDQ2792876

K. A. Germina, K. Nageswara Rao

Publication date: 14 March 2016

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9420.htm

zbMATH Keywords

lattice\(k\)-uniform dcsl index\(k\)-uniform distance-compatible set-labeling1-uniform distance-compatible set-labelingdcsl indexdimension of the posetpartition of the poset

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Constructions of 1-uniform dcsl graphs using well-graded families of sets ⋮ On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar

This page was built for publication: DIMENSION OF VERTEX LABELING OF k-UNIFORM dcsl PATH