Advertisement
Published in:
2024 | OriginalPaper | Chapter
Changing the Uniform Spectrum by Deleting Edges
Authors : Drake Olejniczak, Robert Vandell
Published in: Combinatorics, Graph Theory and Computing
Publisher: Springer Nature Switzerland
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by (Link opens in a new window)
Abstract
A graph is said to be k-uniformly connected if there exists a path of length k between each pair of vertices. This generalizes the well-known concept of a Hamiltonian-connected graph—a graph, order n, in which there exits a Hamiltonian path (path of length \(n-1\)) between each pair of vertices. That is, a graph is Hamiltonian-connected if and only if it is \((n-1)\)-uniformly connected. One can also say a graph is complete if and only if it is 1-uniformly connected. The uniform spectrum of a graph G is the set of all k for which G is k-uniformly connected. In this chapter, we investigate the impact of adding or deleting vertices or edges on the uniform spectrum of a graph. Some general results are presented as well as analyses of specific classes of graphs such as bipartite graphs and wheels.
