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...

Full description

Saved in:
Bibliographic Details
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!