Labeling Circulant Graphs: Distance Two Condition
Given <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi><mo>≥</mo><mn>6</mn></mrow></semantics></math></inline-formula>, <inline-formu...
Main Authors: | Laila Loudiki, Ez-Zobair Bidine, Mustapha Kchikech |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-12-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/15/12/2160 |
Similar Items
-
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
by: R. El-Shanawany, et al.
Published: (2017-12-01) -
L(2, 1)-Labeling of Circulant Graphs
by: Mitra Sarbari, et al.
Published: (2019-02-01) -
Independence Number and Packing Coloring of Generalized Mycielski Graphs
by: Bidine Ez Zobair, et al.
Published: (2021-08-01) -
Some distance magic graphs
by: Aloysius Godinho, et al.
Published: (2018-04-01) -
Labeling cacti with a condition at distance two
by: S. K. Vaidya, et al.
Published: (2011-06-01)