اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPeaks on Graphs
52
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than the label of all its neighbors. Fix an enumeration of the vertices of $G$ as $v_1,v_2,ldots, v_{n}$ and a fix a set $Ssubset V(G)$. We want to determine the number of distinct bijective labelings of the vertices of $G$, such that the vertices in $S$ are precisely the peaks of $G$. The set $S$ is called the emph{peak set of the graph} $G$, and the set of all labelings with peak set $S$ is denoted by $PSG$. This definition generalizes the study of peak sets of permutations, as that work is the special case of $G$ being the path graph on $n$ vertices. In this paper, we present an algorithm for constructing all of the bijective labelings in $PSG$ for any $Ssubseteq V(G)$. We also explore peak sets in certain families of graphs, including cycle graphs and joins of graphs.
قيم البحث
اقرأ أيضاً
A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdos, conjectured that every graph is common. The conje
ctures by Erdos and by Burr and Rosta were disproved by Thomason and by Sidorenko, respectively, in the late 1980s. Collecting new examples for common graphs had not seen much progress since then, although very recently, a few more graphs are verified to be common by the flag algebra method or the recent progress on Sidorenkos conjecture. Our contribution here is to give a new class of tripartite common graphs. The first example class is so-called triangle-trees, which generalises two theorems by Sidorenko and answers a question by Jagger, v{S}v{t}oviv{c}ek, and Thomason from 1996. We also prove that, somewhat surprisingly, given any tree T, there exists a triangle-tree such that the graph obtained by adding T as a pendant tree is still common. Furthermore, we show that adding arbitrarily many apex vertices to any connected bipartite graph on at most five vertices give a common graph.
An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth of an alm
ost self-centered graph of order $n;$ (2) the maximum independence number of an almost self-centered graph of order $n$ and radius $r;$ (3) the minimum order of a $k$-regular almost self-centered graph and (4) the maximum size of an almost peripheral graph of order $n;$ (5) which numbers are possible for the maximum degree of an almost peripheral graph of order $n;$ (6) the maximum number of vertices of maximum degree in an almost peripheral graph of order $n$ whose maximum degree is the second largest possible. Whenever the extremal graphs have a neat form, we also describe them.
For any integer $mge 2$ and a set $Vsubset {1,dots,m}$, let $(m,V)$ denote the union of congruence classes of the elements in $V$ modulo $m$. We study the Hankel determinants for the number of Dyck paths with peaks avoiding the heights in the set $(m
,V)$. For any set $V$ of even elements of an even modulo $m$, we give an explicit description of the sequence of Hankel determinants in terms of subsequences of arithmetic progression of integers. There are numerous instances for varied $(m,V)$ with periodic sequences of Hankel determinants. We present a sufficient condition for the set $(m,V)$ such that the sequence of Hankel determinants is periodic, including even and odd modulus $m$.
A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $ein E(G)$. Tuttes $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a vertex of degree
three. In this paper, we study the structure and extreme edge density of $3$-flow-critical graphs. We apply structure properties to obtain lower and upper bounds on the density of $3$-flow-critical graphs, that is, for any $3$-flow-critical graph $G$ on $n$ vertices, $$frac{8n-2}{5}le |E(G)|le 4n-10,$$ where each equality holds if and only if $G$ is $K_4$. We conjecture that every $3$-flow-critical graph on $nge 7$ vertices has at most $3n-8$ edges, which would be tight if true. For planar graphs, the best possible density upper bound of $3$-flow-critical graphs on $n$ vertices is $frac{5n-8}{2}$, known from a result of Kostochka and Yancey (JCTB 2014) on vertex coloring $4$-critical graphs by duality.
In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for which, every
regular graph G(n, r) can be extended to an r + 1-regular graph with n vertices. Presence of induced complete bipartite subgraph and complete subgraph is dis- cussed, separately, for the extension of regularity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
