An inequality for the number of vertices with an interval spectrum in edge labelings of regular graphs
N.N. Davtyan, R.R. Kamalian

TL;DR
This paper establishes an upper bound on the number of vertices with interval spectra in edge labelings of regular graphs, linking graph structure and labeling properties.
Contribution
It introduces a novel inequality relating the count of vertices with interval spectra to graph parameters in regular graphs.
Findings
Proves an inequality bounding vertices with interval spectra in regular graphs.
Connects the number of such vertices to graph's connected components and order.
Provides a theoretical framework for analyzing spectrum properties in graph labelings.
Abstract
We consider undirected simple finite graphs. The sets of vertices and edges of a graph are denoted by and , respectively. For a graph , we denote by and the least degree of a vertex of and the number of connected components of , respectively. For a graph and an arbitrary subset denotes the subgraph of the graph induced by the subset of its vertices. An arbitrary nonempty finite subset of consecutive integers is called an interval. A function is called an edge labeling of the graph , if for arbitrary different edges and , the inequality holds. If is a graph, is its arbitrary vertex, and is its arbitrary edge labeling, then the set $S_G(x,\varphi)\equiv\{\varphi(e)/ e\in…
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
TopicsGraph Labeling and Dimension Problems · Graph theory and applications · Advanced Graph Theory Research
