On Friendly Index Sets of 2-Regular Graphs

Kwong, H., Lee, S., & 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

Volume

308

Issue

23

Pages

5522-5532

DOI

10.1016/j.disc.2007.10.018

DOI registrant

Elsevier

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:cee898cfa060 · see in the full table