Covering and 2-degree-packing numbers in graphs
Abstract
In this paper, we give a relationship between the covering number of a simple graph G, β(G), and a new parameter associated to G which is called 2-degree-packing number of G, 2(G). We prove that 2(G)/2≤β(G)≤2(G)-1, for any connected simple graph G, with |E(G)|>2(G), and we give a characterization of simple connected graphs which attains the inequalities.
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.