اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCylindrical Graph Construction (definition and basic properties)
103
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we introduce the {it cylindrical construction} for graphs and investigate its basic properties. We state a main result claiming a weak tensor-like duality for this construction. Details of our motivations and applications of the construction will appear elsewhere.
قيم البحث
اقرأ أيضاً
Interface free energy is the contribution to the free energy of a system due to the presence of an interface separating two coexisting phases at equilibrium. It is also called surface tension. The content of the paper is 1) the definition of the inte
rface free energy from first principles of statistical mechanics; 2) a detailed exposition of its basic properties. We consider lattice models with short range interactions, like the Ising model. A nice feature of lattice models is that the interface free energy is anisotropic so that some results are pertinent to the case of a crystal in equilibrium with its vapor. The results of section 2 hold in full generality.
We propose a new way of defining and studying operads on multigraphs and similar objects. For this purpose, we use the combinatorial species setting. We study in particular two operads obtained with our method. The former is a direct generalization o
f the Kontsevich-Willwacher operad. This operad can be seen as a canonical operad on multigraphs, and has many interesting suboperads. The latter operad is a natural extension of the pre-Lie operad in a sense developed here and it is related to the multigraph operad. We also present various results on some of the finitely generated suboperads of the multigraph operad and establish links between them and the commutative operad and the commutative magmatic operad.
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a new charac
terization of the Shannon capacity $Theta$ via Strassens Positivstellensatz: $Theta(bar{G}) = inf_f f(G)$, where $f : mathsf{Graph} to mathbb{R}_+$ ranges over all monotone semiring homomorphisms. Constructing and classifying graph invariants $mathsf{Graph} to mathbb{R}_+$ which are monotone under graph homomorphisms, additive under join, and multiplicative under disjunctive product is therefore of major interest. We call such invariants semiring-homomorphic. The only known such invariants are all of a fractional nature: the fractional chromatic number, the projective rank, the fractional Haemers bounds, as well as the Lovasz number (with the latter two evaluated on the complementary graph). Here, we provide a unified construction of these invariants based on linear-like semiring families of graphs. Along the way, we also investigate the additional algebraic structure on the semiring of graphs corresponding to fractionalization. Linear-like semiring families of graphs are a new concept of combinatorial geometry different from matroids which may be of independent interest.
A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $Msubseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution, we are int
erested in $k$-matchings within the four standard graph products: the Cartesian, strong, direct and lexicographic product. As we shall see, the problem of finding non-empty $k$-matchings ($kgeq 3$) in graph products is NP-complete. Due to the general intractability of this problem, we focus on distinct polynomial-time constructions of $k$-matchings in a graph product $Gstar H$ that are based on $k_G$-matchings $M_G$ and $k_H$-matchings $M_H$ of its factors $G$ and $H$, respectively. In particular, we are interested in properties of the factors that have to be satisfied such that these constructions yield a maximum $k$-matching in the respective products. Such constructions are also called well-behaved and we provide several characterizations for this type of $k$-matchings. Our specific constructions of $k$-matchings in graph products satisfy the property of being weak-homomorphism preserving, i.e., constructed matched edges in the product are never projected to unmatched edges in the factors. This leads to the concept of weak-homomorphism preserving $k$-matchings. Although the specific $k$-matchings constructed here are not always maximum $k$-matchings of the products, they have always maximum size among all weak-homomorphism preserving $k$-matchings. Not all weak-homomorphism preserving $k$-matchings, however, can be constructed in our manner. We will, therefore, determine the size of maximum-sized elements among all weak-homomorphims preserving $k$-matching within the respective graph products, provided that the matchings in the factors satisfy some general assumptions.
The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of $k$-WL to recognition of graph properties. Let $G$ be an input graph with $n$ vertices. We show
that, if $n$ is prime, then vertex-transitivity of $G$ can be seen in a straightforward way from the output of 2-WL on $G$ and on the vertex-individualized copies of $G$. However, if $n$ is divisible by 16, then $k$-WL is unable to distinguish between vertex-transitive and non-vertex-transitive graphs with $n$ vertices as long as $k=o(sqrt n)$. Similar results are obtained for recognition of arc-transitivity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
