Journal Issue10.1002/JGT.V58:4
Non-path spectrum sets
112
TL;DR: In this article, it was shown that, for every positive integer k ≥ 3, there are infinitely many sets of k positive integers which are not path spectrum sets, and that all sets of positive integers with cardinality of 1 or 2 are path spectra sets.
read more
Abstract: A path of a graph is called maximal if it is not a proper subpath of any other path of the graph. The path spectrum of a graph G, denoted by ps(G), is the set of lengths of all maximal paths in the graph. A set S of positive integers is called a path spectrum if there is a connected graph G such that ps(G) = S. Jacobson et al. showed that all sets of positive integers with cardinality of 1 or 2 are path spectrum sets. Their results raised the question of whether all sets of positive integers are path spectra. We show that, for every positive integer k ≥ 3, there are infinitely many sets of k positive integers which are not path spectra. A set S of positive integers is called an absolute path spectrum if there are infinitely many connected graphs G such that ps(G) = S. We completely characterize absolute path spectra S for |S| ≤ 2. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 329–350, 2008
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A New Upper Bound for the Irregularity Strength of Graphs
TL;DR: A weighting of the edges of a graph is called irregular if the weighted degrees of the vertices are all different, and it is shown that such a weighting is possible from the weight set {1,2,…,...
On-line Ramsey Numbers
TL;DR: A new upper bound is proved for the on-line Ramsey number of the complete bipartite graph $K_{t,t}$, showing that there exists a positive constant $c$ such that $\tilde{r}(K_t)leq t^{-c\frac{\log t}{\log t}}4^t$.
57
Connectivity of Strong Products of Graphs
TL;DR: It is proved that every minimum separating set in the strong product G = H is either an I-set or an L-set in $${G\boxtimes H}$$.
On the geodetic and the hull numbers in strong product graphs
TL;DR: This work investigates the behavior of both geodetic and hull sets with respect to the strong product operation for graphs and establishes some bounds for the geodetics number and the hull number and obtains the exact value of these parameters for a number of strong product graphs.
44
Total Vertex Irregularity Strength of Dense Graphs
P. Majerski,Jakub Przybyło +1 more
TL;DR: It is proved that the total vertex irregularity strength of graphs with i½?i¾?n0.5lnn is bounded from above by 2+o1ni¾?
41
References
•Book
Graph theory with applications
J. A. Bondy
- 01 Jan 1976
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
8.8K
•Book
Modern graph theory
Béla Bollobás
- 01 Jan 1998
TL;DR: This book presents an account of newer topics, including Szemer'edi's Regularity Lemma and its use; Shelah's extension of the Hales-Jewett Theorem; the precise nature of the phase transition in a random graph process; the connection between electrical networks and random walks on graphs; and the Tutte polynomial and its cousins in knot theory.
3.9K