On Friendly Index Sets of 2-Regular Graphs

Harris Kwong, S. L., & Ng, H. K. (2008). On Friendly Index Sets of 2-Regular Graphs. Discrete Mathematics, 308(23), 5522-5532.

Type

Journal article

Intellectual base

Primary research

Year

2008

DOI

10.1016/j.disc.2007.10.018

Link

https://doi.org/10.1016/j.disc.2007.10.018

Cited by

1 citation across 1 artifact.

Domain-specific

• Friendly-index set
  • The friendly-index set of a graph is the set of absolute edge-label count differences attained by all friendly binary vertex labelings, where a labeling is friendly when its two vertex-label counts differ by at most one and edge labels are induced from endpoint labels modulo two.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:cee898cfa060 · see in the full table