Edge general position sets in Fibonacci and Lucas cubes

Abstract

A set of edges X⊂eq E(G) of a graph G is an edge general position set if no three edges from X lie on a common shortest path in G. The cardinality of a largest edge general position set of G is the edge general position number of G. In this paper edge general position sets are investigated in partial cubes. In particular it is proved that the union of two largest -classes of a Fibonacci cube or a Lucas cube is a maximal edge general position set.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…