Constructions of 1-uniform dcsl graphs using well-graded families of sets
From MaRDI portal
Publication:327617
DOI10.1016/j.endm.2016.05.004zbMath1347.05209OpenAlexW2512898713MaRDI QIDQ327617
K. Nageswara Rao, K. A. Germina, P. Shaini
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Retracts of strong products of graphs
- Isometric embedding in products of complete graphs
- Partial cubes: Structures, characterizations, and constructions
- Parallel concepts in graph theory
- Well-graded families of relations
- On the constructions of sequential graphs
- DIMENSION OF VERTEX LABELING OF k-UNIFORM dcsl PATH
- 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
- On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar