1,945 research outputs found
On the forcing spectrum of generalized Petersen graphs P(n,2)
The forcing number of a perfect matching of a graph is the smallest
cardinality of subsets of that are contained in no other perfect matchings
of . The forcing spectrum of is the collection of forcing numbers of all
perfect matchings of . In this paper, we classify the perfect matchings of a
generalized Petersen graph in two types, and show that the forcing
spectrum is the union of two integer intervals. For , it is
, where if (mod 7), and otherwise
On Mixed Domination in Generalized Petersen Graphs
Given a graph , a set of vertices and
edges is called a mixed dominating set if every vertex and edge that is not
included in happens to be adjacent or incident to a member of . The
mixed domination number of the graph is the size of the
smallest mixed dominating set of . We present an explicit method for
constructing optimal mixed dominating sets in Petersen graphs for . Our method also provides a new upper bound for other Petersen
graphs
On the packing chromatic number of Moore graphs
The \emph{packing chromatic number } of a graph is the
smallest integer for which there exists a vertex coloring such that any two vertices of color are
at distance at least . For , -Moore graphs are
-regular graphs with girth which are the incidence graphs of a
symmetric generalized -gons of order . In this paper we study the
packing chromatic number of a -Moore graph . For we present
the exact value of . For , we determine in
terms of the intersection of certain structures in generalized quadrangles. For
, we present lower and upper bounds for this invariant when an
odd prime power.Comment: 14 pages, 2 figure
Packing coloring of Sierpi\'{n}ski-type graphs
The packing chromatic number of a graph is the smallest
integer such that the vertex set of can be partitioned into sets ,
, where each is an -packing. In this paper, we
consider the packing chromatic number of several families of
Sierpi\'{n}ski-type graphs. While it is known that this number is bounded from
above by in the family of Sierpi\'{n}ski graphs with base , we prove
that it is unbounded in the families of Sierpi\'{n}ski graphs with bases
greater than . On the other hand, we prove that the packing chromatic number
in the family of Sierpi\'{n}ski triangle graphs is bounded from above
by . Furthermore, we establish or provide bounds for the packing chromatic
numbers of generalized Sierpi\'{n}ski graphs with respect to all
connected graphs of order 4.Comment: 26 pages, 16 figure
Packing chromatic number of subdivisions of cubic graphs
A packing -coloring of a graph is a partition of into sets
such that for each the distance between any
two distinct is at least . The packing chromatic number,
, of a graph is the minimum such that has a packing
-coloring. For a graph , let denote the graph obtained from by
subdividing every edge. The questions on the value of the maximum of
and of over the class of subcubic graphs appear
in several papers. Gastineau and Togni asked whether for
any subcubic , and later Bresar, Klavzar, Rall and Wash conjectured this,
but no upper bound was proved. Recently the authors proved that is
not bounded in the class of subcubic graphs . In contrast, in this paper we
show that is bounded in this class, and does not exceed .Comment: 20 pages, 15 figure
Packing chromatic number versus chromatic and clique number
The packing chromatic number of a graph is the smallest
integer such that the vertex set of can be partitioned into sets ,
, where each is an -packing. In this paper, we investigate
for a given triple of positive integers whether there exists a graph
such that , , and . If so,
we say that is realizable. It is proved that implies
, and that triples and are not realizable as soon
as . Some of the obtained results are deduced from the bounds proved on
the packing chromatic number of the Mycielskian. Moreover, a formula for the
independence number of the Mycielskian is given. A lower bound on
in terms of and is also proved.Comment: 17 pages, 1 tabl
Generalized Designs on Graphs: Sampling, Spectra, Symmetries
Spherical Designs are finite sets of points on the sphere
with the property that the average of certain (low-degree) polynomials in these
points coincides with the global average of the polynomial on .
They are evenly distributed and often exhibit a great degree of regularity and
symmetry. We point out that a spectral definition of spherical designs easily
transfers to finite graphs -- these 'graphical designs' are subsets of vertices
that are evenly spaced and capture the symmetries of the underlying graph
(should they exist). Our main result states that good graphical designs either
consist of many vertices or their neighborhoods have exponential volume growth.
We show several examples, describe ways to find them and discuss problems.Comment: to appear in Journal of Graph Theor
Line k-Arboricity in Product Networks
A \emph{linear -forest} is a forest whose components are paths of length
at most . The \emph{linear -arboricity} of a graph , denoted by , is the least number of linear -forests needed to decompose .
Recently, Zuo, He and Xue studied the exact values of the linear
-arboricity of Cartesian products of various combinations of complete
graphs, cycles, complete multipartite graphs. In this paper, for general we
show that for any
two graphs and . Denote by , and
the lexicographic product, direct product and strong product of two graphs
and , respectively. We also derive upper and lower bounds of , and
in this paper. The linear -arboricity of a -dimensional grid graph, a
-dimensional mesh, a -dimensional torus, a -dimensional generalized
hypercube and a -dimensional hyper Petersen network are also studied.Comment: 27 page
An infinite family of subcubic graphs with unbounded packing chromatic number
Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic
graphs, Discrete Math.~341 (2018) 474--483] answered in negative the question
that was posed in several earlier papers whether the packing chromatic number
is bounded in the class of graphs with maximum degree . In this note, we
present an explicit infinite family of subcubic graphs with unbounded packing
chromatic number.Comment: 9 page
Packing -coloring of subcubic outerplanar graphs
For and a graph , a packing -coloring of , is a partition of into sets such that for each the distance between any
two distinct is at least . The packing chromatic number,
, of a graph is the smallest such that has a packing
-coloring. It is known that there are trees of maximum degree
4 and subcubic graphs with arbitrarily large . Recently, there
was a series of papers on packing -colorings of
subcubic graphs in various classes. We show that every -connected subcubic
outerplanar graph has a packing -coloring and every subcubic
outerplanar graph is packing -colorable. Our results are sharp in
the sense that there are -connected subcubic outerplanar graphs that are not
packing -colorable and there are subcubic outerplanar graphs that are
not packing -colorable.Comment: 12 pages, 3 figure
- …