Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum (1410.7927v1)

Published 29 Oct 2014 in cs.DM and math.CO

Abstract: The sets of vertices and edges of an undirected, simple, finite, connected graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping $\varphi:E(G)\rightarrow {1,2,...,|E(G)|}$ is called a labeling of the graph $G$. If $G$ is a graph, $x$ is its arbitrary vertex, and $\varphi$ is its arbitrary labeling, then the set $S_G(x,\varphi)\equiv{\varphi(e)/ e\in E(G), e \textrm{is incident with} x$} is called a spectrum of the vertex $x$ of the graph $G$ at its labeling $\varphi$. For any graph $G$ and its arbitrary labeling $\varphi$, a structure of the subgraph of $G$, induced by the subset of vertices of $G$ with an interval spectrum, is described.

Citations (1)

Summary

We haven't generated a summary for this paper yet.