اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWhen is the Direct Product of Generalized Mycielskians a Cover Graph?
203
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) = {(g_i,h_s)(g_j,h_t): g_ig_j belongs to E(G) and h_sh_t belongs to E(H)}. We prove that the direct product M_m(G) X M_n(H) of the generalized Mycielskians of G and H is a cover graph if and only if G or H is bipartite.
قيم البحث
اقرأ أيضاً
A balanced pair in an ordered set $P=(V,leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and claim any or
dered set that has a good pair will satisfy the conjecture and furthermore every ordered set which is not totally ordered and has a forest as its cover graph has a good pair.
A graph $X$ is said to be unstable if the direct product $X times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is unstable,
connected, and nonbipartite, and no two distinct vertices of X have exactly the same neighbors. We find three new conditions that each imply a circulant graph is unstable. (These yield infinite families of nontrivially unstable circulant graphs that were not previously known.) We also find all of the nontrivially unstable circulant graphs of order $2p$, where $p$ is any prime number. Our results imply that there does not exist a nontrivially unstable circulant graph of order $n$ if and only if either $n$ is odd, or $n < 8$, or $n = 2p$, for some prime number $p$ that is congruent to $3$ modulo $4$.
A graph $X$ is said to be unstable if the direct product $X times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is unstable,
connected, and non-bipartite, and no two distinct vertices of X have exactly the same neighbors. We find all of the nontrivially unstable circulant graphs of valency at most $7$. (They come in several infinite families.) We also show that the instability of each of these graphs is explained by theorems of Steve Wilson. This is best possible, because there is a nontrivially unstable circulant graph of valency $8$ that does not satisfy the hypotheses of any of Wilsons four instability theorems for circulant graphs.
For a simple graph $G=(V,E),$ let $mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij} eq 0$ if ${i,j}in E$ and $a_{ij}=0$ if ${i,j} otin E$. The maximum positive semidefinite nullity of $G$, denoted
$operatorname{M}_+(G),$ is $max{operatorname{null}(A)|Ain mathcal{S}_+(G)}.$ A tree cover of $G$ is a collection of vertex-disjoint simple trees occurring as induced subgraphs of $G$ that cover all the vertices of $G$. The tree cover number of $G$, denoted $T(G)$, is the cardinality of a minimum tree cover. It is known that the tree cover number of a graph and the maximum positive semidefinite nullity of a graph are equal for outerplanar graphs, and it was conjectured in 2011 that $T(G)leq M_+(G)$ for all graphs [Barioli et al., Minimum semidefinite rank of outerplanar graphs and the tree cover number, $ Elec. J. Lin. Alg.,$ 2011]. We show that the conjecture is true for certain graph families. Furthermore, we prove bounds on $T(G)$ to show that if $G$ is a connected outerplanar graph on $ngeq 2$ vertices, then $operatorname{M}_+(G)=T(G)leq leftlceilfrac{n}{2}rightrceil$, and if $G$ is a connected outerplanar graph on $ngeq 6$ vertices with no three or four cycle, then $operatorname{M}_+(G)=T(G)leq frac{n}{3}$. We also characterize connected outerplanar graphs with $operatorname{M}_+(G)=T(G)=leftlceilfrac{n}{2}rightrceil.$
Let $phi_H^r(n)$ be the smallest integer such that, for all $r$-graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $phi_H^r(n)$ parts, of which every part either is a single edge or forms an $r$-graph isomorphic to $H$. T
he function $phi^2_H(n)$ has been well studied in literature, but for the case $rge 3$, the problem that determining the value of $phi_H^r(n)$ is widely open. Sousa (2010) gave an asymptotic value of $phi_H^r(n)$ when $H$ is an $r$-graph with exactly 2 edges, and determined the exact value of $phi_H^r(n)$ in some special cases. In this paper, we first give the exact value of $phi_H^r(n)$ when $H$ is an $r$-graph with exactly 2 edges, which improves Sousas result. Second we determine the exact value of $phi_H^r(n)$ when $H$ is an $r$-graph consisting of exactly $k$ independent edges.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
