
TL;DR
This paper introduces the concept of threshold numbers in graphs, determines these numbers for various path-related graphs, and extends existing results to more complex graph classes, solving an open problem.
Contribution
It defines threshold numbers for graphs, computes these for path-related graphs, and extends prior work to new graph classes, addressing an open problem.
Findings
Threshold numbers for linear forests, ladders, and tents are determined.
Exact threshold numbers for specific multipartite and cluster graphs are established.
Results solve an open problem on threshold numbers for certain graph classes.
Abstract
A graph is called a \emph{-threshold graph} with \emph{thresholds} if we can assign a real number to each vertex , such that for any , we have if and only if holds true for an odd number of elements in . The smallest integer such that is a -threshold graph is called the \emph{threshold number} of . For the complete multipartite graphs and the cluster graphs, Kittipassorn and Sumalroj determined the exact threshold numbers of and . In this paper, first we determine the threshold numbers of some path-related graphs, including linear forests, ladders, and tents. Then, on the basis of Kittipassorn and Sumalroj's results, we determine the exact threshold numbers of and $n_1…
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
