On the dimension of vertex labeling of k-uniform dcsl of an even cycle

DOI10.3906/mat-1505-20zbMath1424.05257OpenAlexW2792966911MaRDI QIDQ4634123

K. A. Germina, K. Nageswara Rao

Publication date: 7 May 2019

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3906/mat-1505-20

zbMATH Keywords

dimension of the poset\(k\)-uniform distance compatible set labeling

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Partial cubes: Structures, characterizations, and constructions
• The dimension of planar posets
• Dimension of the crown \(S^k_n\)
• Well-graded families of relations
• Stochastic token theory
• The dimension of posets with planar cover graphs.
• Distance-preserving subgraphs of hypercubes
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• A decomposition theorem for partially ordered sets
• Characterization of Vertex labeling of 1-uniform dcsl graph which form a lattice
• CHARACTERIZATION OF 1-UNIFORM dcsl GRAPHS AND WELL GRADED FAMILY OF SETS
• Partial orders of dimension 2
• A Dual of Dilworth's Decomposition Theorem
• On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar
• Partially Ordered Sets
• On the dimension of partially ordered sets