اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدErratum for On oriented cliques with respect to push operation
42
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An error is spotted in the statement of Theorem~1.3 of our published article titled On oriented cliques with respect to push operation (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to spanning subgraph inclusion) underlying planar push cliques. The error was that, one of the 16 graphs from the above list was missing an arc. We correct the error and restate the corrected statement in this article. We also point out the reason for the error and comment that the error occurred due to a mistake in a particular lemma. We present the corrected proof of that particular lemma as well. Moreover, a few counts were wrongly reported due to the above mentioned error. So we update our reported counts after correction in this article.
قيم البحث
اقرأ أيضاً
The robustness of a network is depending on the type of attack we are considering. In this paper we focus on the spread of viruses on networks. It is common practice to use the epidemic threshold as a measure for robustness. Because the epidemic thre
shold is inversely proportional to the largest eigenvalue of the adjacency matrix, it seems easy to compare the robustness of two networks. We will show in this paper that the comparison of the robustness with respect to virus spread for two networks actually depends on the value of the effective spreading rate tau. For this reason we propose a new metric, the viral conductance, which takes into account the complete range of values tau can obtain. In this paper we determine the viral conductance of regular graphs, complete bi-partite graphs and a number of realistic networks.
A famous conjecture of Gyarfas and Sumner states for any tree $T$ and integer $k$, if the chromatic number of a graph is large enough, either the graph contains a clique of size $k$ or it contains $T$ as an induced subgraph. We discuss some results a
nd open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star $S$ and integer $k$, if the chromatic number of a digraph is large enough, either the digraph contains a clique of size $k$ or it contains $S$ as an induced subgraph. As an evidence, we prove that for any oriented star $S$, every oriented graph with sufficiently large chromatic number contains either a transitive tournament of order $3$ or $S$ as an induced subdigraph. We then study for which sets ${cal P}$ of orientations of $P_4$ (the path on four vertices) similar statements hold. We establish some positive and negative results.
Many different types of fractional calculus have been proposed, which can be organised into some general classes of operators. For a unified mathematical theory, results should be proved in the most general possible setting. Two important classes of
fractional-calculus operators are the fractional integrals and derivatives with respect to functions (dating back to the 1970s) and those with general analytic kernels (introduced in 2019). To cover both of these settings in a single study, we can consider fractional integrals and derivatives with analytic kernels with respect to functions, which have never been studied in detail before. Here we establish the basic properties of these general operators, including series formulae, composition relations, function spaces, and Laplace transforms. The tools of convergent series, from fractional calculus with analytic kernels, and of operational calculus, from fractional calculus with respect to functions, are essential ingredients in the analysis of the general class that covers both.
The purpose of this erratum is to correct the proof of Theorem A.0.1 in the appendix to our article ``Hadamard spaces with isolated flats math.GR/0411232, which was jointly authored by Mohamad Hindawi, Hruska and Kleiner. In that appendix, many of th
e results of math.GR/0411232 about CAT(0) spaces with isolated flats are extended to a more general setting in which the isolated subspaces are not necessarily flats. However, one step of that extension does not follow from the argument we used the isolated flats setting. We provide a new proof that fills this gap. In addition, we give a more detailed account of several other parts of Theorem A.0.1, which were sketched in math.GR/0411232.
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced graph contain
ing $G$ as a proper induced subgraph has a higher rank. The main intent of this paper is to present some results on maximal graphs. First, we introduce a characterization of maximal trees (a reduced tree is a maximal tree if it is not a proper subtree of a reduced tree with the same rank). Next, we give a near-complete characterization of maximal `generalized friendship graphs. Finally, we present an enumeration of all maximal graphs with ranks $8$ and $9$. The ranks up to $7$ were already done by Lepovic (1990), Ellingham (1993), and Lazic (2010).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
