Skolem Number of Kagome Lattice Graphs
A proper Skolem labelling of a graph $G$ is a function assigning a positive integer to each vertex of $G$ such that any two vertices assigned the same integer are that distance apart in the graph. The Skolem number of a graph is smallest number $n$ such that there exists a proper Skolem labelling on...
Saved in:
| Main Authors: | Braxton Carrigan, Max Martone |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2025-01-01
|
| Series: | Theory and Applications of Graphs |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol12/iss1/7/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Skolem's Paradox and Platonism
by: Carlo Cellucci
Published: (1970-05-01) -
Realization of Kagome Kondo lattice
by: Boqin Song, et al.
Published: (2025-07-01) -
Sequent calculus Sk4 for skolemized formulas
by: Andrejus Belovas, et al.
Published: (2005-12-01) -
Nonlinearity-induced corner states in a kagome lattice
by: K Prabith, et al.
Published: (2025-01-01) -
Triple-Q state in magnetic breathing kagome lattice
by: Hangyu Zhou, et al.
Published: (2025-07-01)