On the $\mu$-parameters of the Petersen graph
N.N. Davtyan

TL;DR
This paper investigates specific parameters related to proper edge colorings of the Petersen graph, providing exact values for these parameters that measure the extent of interval spectra at vertices.
Contribution
The paper determines the exact values of the parameters _{11}, _{12}, _{21}, and _{22} for the Petersen graph, a problem previously unresolved.
Findings
Exact values of _{11}, _{12}, _{21}, _{22} for the Petersen graph.
Characterization of proper edge colorings with interval spectra.
Insights into the structure of edge colorings in the Petersen graph.
Abstract
For an undirected, simple, finite, connected graph , we denote by and the sets of its vertices and edges, respectively. A function is called a proper edge -coloring of a graph , if adjacent edges are colored differently and each of colors is used. The least value of for which there exists a proper edge -coloring of a graph is denoted by . For any graph , and for any integer satisfying the inequality , we denote by the set of all proper edge -colorings of . Let us also define a set of all proper edge colorings of a graph : An arbitrary nonempty finite subset of consecutive integers is called an interval. If and , then the set of colors of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Graph Labeling and Dimension Problems
