12 research outputs found
A lower bound on the acyclic matching number of subcubic graphs
The acyclic matching number of a graph is the largest size of an acyclic
matching in , that is, a matching in such that the subgraph of
induced by the vertices incident to an edge in is a forest. We show that
the acyclic matching number of a connected subcubic graph with edges is
at least except for two small exceptions
Largest 2-regular subgraphs in 3-regular graphs
For a graph , let denote the largest number of vertices in a
-regular subgraph of . We determine the minimum of over
-regular -vertex simple graphs . To do this, we prove that every
-regular multigraph with exactly cut-edges has a -regular subgraph
that omits at most vertices. More generally,
every -vertex multigraph with maximum degree and edges has a
-regular subgraph that omits at most vertices. These bounds are sharp; we describe the
extremal multigraphs
On strongly spanning -edge-colorable subgraphs
A subgraph of a multigraph is called strongly spanning, if any vertex
of is not isolated in , while it is called maximum -edge-colorable,
if is proper -edge-colorable and has the largest size. We introduce a
graph-parameter , that coincides with the smallest that a graph
has a strongly spanning maximum -edge-colorable subgraph. Our first result
offers some alternative definitions of . Next, we show that
is an upper bound for , and then we characterize the class of graphs
that satisfy . Finally, we prove some bounds for that
involve well-known graph-theoretic parameters.Comment: 12 pages, no figure
Graphs, Disjoint Matchings and Some Inequalities
For and a graph let denote the size of a maximum
-edge-colorable subgraph of . Mkrtchyan, Petrosyan and Vardanyan proved
that , for
any cubic graph ~\cite{samvel:2010}. They were also able to show that if
is a cubic graph, then
~\cite{samvel:2014} and
~\cite{samvel:2010}. In the first part of the present work, we show that the
last two inequalities imply the first two of them.
Moreover, we show that , where
, if is a cubic graph,
, if is a cubic graph containing a perfect
matching,
, if is a bridgeless cubic graph.
We also investigate the parameters and in the class of
claw-free cubic graphs. We improve the lower bounds for and
for claw-free bridgeless cubic graphs to
(), . On the basis of
these inequalities we are able to improve the coefficient for
bridgeless claw-free cubic graphs.
In the second part of the work, we prove lower bounds for in terms
of for and graphs
containing at most cycle. We also present the corresponding conjectures for
bipartite and nearly bipartite graphs.Comment: 22 pages, 14 figure
Game matching number of graphs
We study a competitive optimization version of , the maximum size
of a matching in a graph . Players alternate adding edges of to a
matching until it becomes a maximal matching. One player (Max) wants that
matching to be large; the other (Min) wants it to be small. The resulting sizes
under optimal play when Max or Min starts are denoted \Max(G) and \Min(G),
respectively. We show that always |\Max(G)-\Min(G)|\le 1. We obtain a
sufficient condition for \Max(G)=\alpha'(G) that is preserved under cartesian
product. In general, \Max(G)\ge \frac23\alpha'(G), with equality for many
split graphs, while \Max(G)\ge\frac34\alpha'(G) when is a forest.
Whenever is a 3-regular -vertex connected graph, \Max(G) \ge n/3, and
there are such examples with \Max(G)\le 7n/18. For an -vertex path or
cycle, the answer is roughly .Comment: 16 pages; this version improves explanations at a number of points
and adds a few more example
Some bounds on the uniquely restricted matching number
A matching in a graph is uniquely restricted if no other matching covers
exactly the same set of vertices. We establish tight lower bounds on the
maximum size of a uniquely restricted matching in terms of order, size, and
maximum degree
Directed Domination in Oriented Graphs
A directed dominating set in a directed graph is a set of vertices of
such that every vertex has an adjacent vertex
in with directed to . The directed domination number of , denoted
by , is the minimum cardinality of a directed dominating set in .
The directed domination number of a graph , denoted , which is
the maximum directed domination number over all orientations of
. The directed domination number of a complete graph was first studied by
Erd\"{o}s [Math. Gaz. 47 (1963), 220--222], albeit in disguised form. We extend
this notion to directed domination of all graphs. If denotes the
independence number of a graph , we show that if is a bipartite graph,
we show that . We present several lower and upper bounds
on the directed domination number.Comment: 18 page
Assigning tasks to agents under time conflicts: a parameterized complexity approach
We consider the problem of assigning tasks to agents under time conflicts,
with applications also to frequency allocations in point-to-point wireless
networks. In particular, we are given a set of agents, a set of
tasks, and different time slots. Each task can be carried out in one of the
predefined time slots, and can be represented by the subset
of the involved agents. Since each agent cannot participate to more than one
task simultaneously, we must find an allocation that assigns non-overlapping
tasks to each time slot. Being the number of slots limited by , in general
it is not possible to executed all the possible tasks, and our aim is to
determine a solution maximizing the overall social welfare, that is the number
of executed tasks. We focus on the restriction of this problem in which the
number of time slots is fixed to be , and each task is performed by
exactly two agents, that is . In fact, even under this assumptions, the
problem is still challenging, as it remains computationally difficult. We
provide parameterized complexity results with respect to several reasonable
parameters, showing for the different cases that the problem is fixed-parameter
tractable or it is paraNP-hard.Comment: 31 pages, 3 figure
A tight lower bound on the matching number of graphs via Laplacian eigenvalues
Let and denote the matching number of a non-empty simple
graph with vertices and the -th smallest eigenvalue of its Laplacian
matrix, respectively. In this paper, we prove a tight lower bound This bound strengthens the
result of Brouwer and Haemers who proved that if is even and , then has a perfect matching. A graph is factor-critical if for
every vertex , has a perfect matching. We also prove an
analogue to the result of Brouwer and Haemers mentioned above by showing that
if is odd and , then is factor-critical. We use the
separation inequality of Haemers to get a useful lemma, which is the key idea
in the proofs. This lemma is of its own interest and has other applications. In
particular, we prove similar results for the number of balloons, spanning even
subgraphs, as well as spanning trees with bounded degree.Comment: The first manuscript was done in May 2020, and the current manuscript
was accepted by European Journal of Combinatorics in October 202
On maximum -edge-colorable subgraphs of bipartite graphs
If , then a -edge-coloring of a graph is an assignment of
colors to edges of from the set of colors, so that adjacent edges
receive different colors. A -edge-colorable subgraph of is maximum if it
is the largest among all -edge-colorable subgraphs of . For a graph
and , let be the number of edges of a maximum
-edge-colorable subgraph of . In 2010 Mkrtchyan et al. proved that if
is a cubic graph, then . This result
implies that if the cubic graph contains a perfect matching, in particular
when it is bridgeless, then . One may
wonder whether there are other interesting graph-classes, where a relation
between and can be proved. Related
with this question, in this paper we show that for any bipartite graph ,
and .Comment: 11 pages, 1 figur