On the extremal values of the number of vertices with an interval spectrum on the set of proper edge colorings of the graph of the n-dimensional cube
Abstract
For an undirected, simple, finite, connected graph G, we denote by V(G) and E(G) the sets of its vertices and edges, respectively. A function :E(G)→ \1,...,t\ is called a proper edge t-coloring of a graph G, if adjacent edges are colored differently and each of t colors is used. The least value of t for which there exists a proper edge t-coloring of a graph G is denoted by '(G). For any graph G, and for any integer t satisfying the inequality '(G)≤ t≤ |E(G)|, we denote by α(G,t) the set of all proper edge t-colorings of G. Let us also define a set α(G) of all proper edge colorings of a graph G: α(G)t='(G)|E(G)|α(G,t). An arbitrary nonempty finite subset of consecutive integers is called an interval. If ∈α(G) and x∈ V(G), then the set of colors of edges of G which are incident with x is denoted by SG(x,) and is called a spectrum of the vertex x of the graph G at the proper edge coloring . If G is a graph and ∈α(G), then define fG()|\x∈ V(G)/SG(x,) is an interval\|. For a graph G and any integer t, satisfying the inequality '(G)≤ t≤ |E(G)|, we define: μ1(G,t)∈α(G,t)fG(), μ2(G,t)∈α(G,t)fG(). For any graph G, we set: μ11(G)'(G)≤ t≤|E(G)|μ1(G,t), μ12(G)'(G)≤ t≤|E(G)|μ1(G,t), μ21(G)'(G)≤ t≤|E(G)|μ2(G,t), μ22(G)'(G)≤ t≤|E(G)|μ2(G,t). For any positive integer n, the exact values of the parameters μ11, μ12, μ21 and μ22 are found for the graph of the n-dimensional cube.
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.