Graphs and Combinatorics最新文献

The k-weak-dynamic number of a graph G is the smallest number of colors we need to color the vertices of G in such a way that each vertex v of degree d(v) sees at least min({k,d(v)}) colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6.

Given an edge-colored graph (G_c), a set of p pairs of vertices ((a_i,b_i)) together with p numbers (k_1,k_2, ldots k_p) associated with the pairs, can we find a set of alternating paths linking the pairs ((a_1,b_1)), ((a_2,b_2), ldots ), in their respective numbers (k_1,k_2,ldots k_p)? Such is the question addressed in this paper. The problem being highly intractable, we consider a restricted version of it to edge-colored complete graphs. Even so restricted, the problem remains intractable if the paths/trails must be edge-disjoint, but it ceases to be so if the paths/trails are to be vertex-disjoint, as is proved in this paper. An approximation algorithm is presented in the end, with a performance ratio asymptotically close to 3/4 for a restricted version of the problem.

The Borodin–Kostochka Conjecture states that for a graph G, if (Delta (G)ge 9), then (chi (G)le max {Delta (G)-1,omega (G)}). In this paper, we prove the Borodin–Kostochka Conjecture holding for odd-hole-free graphs.

We deal with a variant of the 1–2–3 Conjecture introduced by Gao, Wang, and Wu (Graphs Combin 32:1415–1421, 2016) . This variant asks whether all graphs can have their edges labelled with 1 and 2 so that when computing the sums of labels incident to the vertices, no monochromatic cycle appears. In the aforementioned seminal work, the authors mainly verified their conjecture for a few classes of graphs, namely graphs with maximum average degree at most 3 and series–parallel graphs, and observed that it also holds for simple classes of graphs (cycles, complete graphs, and complete bipartite graphs). In this work, we provide a deeper study of this conjecture, establishing strong connections with other, more or less distant notions of graph theory. While this conjecture connects quite naturally to other notions and problems surrounding the 1–2–3 Conjecture, it can also be expressed so that it relates to notions such as the vertex-arboricity of graphs. Exploiting such connections, we provide easy proofs that the conjecture holds for bipartite graphs and 2-degenerate graphs, thus generalising some of the results of Gao, Wang, and Wu. We also prove that the conjecture holds for graphs with maximum average degree less than (frac{10}{3}), thereby strengthening another of their results. Notably, this also implies the conjecture holds for planar graphs with girth at least 5. All along the way, we also raise observations and results highlighting why the conjecture might be of greater interest.

For graphs F, G, and H, we write (F rightarrow (G,H)) if every red-blue coloring of the edges of F produces a red copy of G or a blue copy of H. The graph F is said to be (G, H)-minimal if it is subgraph-minimal with respect to this property. The characterization problem for Ramsey-minimal graphs is classically done for finite graphs. In 2021, Barrett and the second author generalized this problem to infinite graphs. They asked which pairs (G, H) admit a Ramsey-minimal graph and which ones do not. We show that any pair of star forests such that at least one of them involves an infinite-star component admits no Ramsey-minimal graph. Also, we construct a Ramsey-minimal graph for a finite star forest versus a subdivision graph. This paper builds upon the results of Burr et al. (Discrete Math 33:227–237, 1981) on Ramsey-minimal graphs for finite star forests.

We consider multipermutations and a certain partial order, the weak Bruhat order, on this set. This generalizes the Bruhat order for permutations, and is defined in terms of containment of inversions. Different characterizations of this order are given. We also study special multipermutations called Stirling multipermutations and their properties.

Abstract

Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids significantly differ from bicircular matroids. Recently, it was proved that all cosimple lattice path matroids have positive double circuits, while it was shown that there is a large class of cosimple bicircular matroids with no positive double circuits. These observations support Bonin and de Miers’ claim. Finally, Sivaraman and Slilaty suggested studying the intersection of lattice path matroids and bicircular matroids as a possibly interesting research topic. In this work, we exhibit the excluded bicircular matroids for the class of lattice path matroids, and we propose a characterization of the graph family whose bicircular matroids are lattice path matroids. As an application of this characterization, we propose a geometric description of 2-connected lattice path bicircular matroids.

The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently the class of graphs in which all associated symmetric matrices possess the Strong Spectral Property (denoted ({mathcal {G}}^textrm{SSP})) were studied, and along these lines we aim to study properties of graphs that exhibit a so-called barbell partition. Such a partition is a known impediment to membership in the class ({mathcal {G}}^textrm{SSP}). In particular we consider the existence of barbell partitions under various standard and useful graph operations. We do so by considering both the preservation of an already present barbell partition after performing said graph operations as well as barbell partitions which are introduced under certain graph operations. The specific graph operations we consider are the addition and removal of vertices and edges, the duplication of vertices, as well as the Cartesian products, tensor products, strong products, corona products, joins, and vertex sums of two graphs. We also identify a correspondence between barbell partitions and graph substructures called forts, using this correspondence to further connect the study of zero forcing and the Strong Spectral Property.

Using the special value at (u=1) of the Artin-Ihara L-function, we give a short proof of the count of the number of spanning trees in the n-cube.

Let G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G. The connected domination number (gamma _c(G)) of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is in S or adjacent to some vertex of S, and which induces a connected subgraph in G. We prove that the oriented diameter of a bridgeless graph G is at most (2 gamma _c(G) +3) if (gamma _c(G)) is even and (2 gamma _c(G) +2) if (gamma _c(G)) is odd. This bound is sharp. For (d in {mathbb {N}}), the d-distance domination number (gamma ^d(G)) of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is at distance at most d from some vertex of S. As an application of a generalisation of the above result on the connected domination number, we prove an upper bound on the oriented diameter of the form ((2d+1)(d+1)gamma ^d(G)+ O(d)). Furthermore, we construct bridgeless graphs whose oriented diameter is at least ((d+1)^2 gamma ^d(G) +O(d)), thus demonstrating that our above bound is best possible apart from a factor of about 2.