1,850 research outputs found
The crossing number of locally twisted cubes
The {\it crossing number} of a graph is the minimum number of pairwise
intersections of edges in a drawing of . Motivated by the recent work
[Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper
bound on the crossing number of the hypercube. J. Graph Theory {\bf 59},
145--161 (2008)] which solves the upper bound conjecture on the crossing number
of -dimensional hypercube proposed by Erd\H{o}s and Guy, we give upper and
lower bounds of the crossing number of locally twisted cube, which is one of
variants of hypercube.Comment: 17 pages, 12 figure
Graph realizations constrained by skeleton graphs
In 2008 Amanatidis, Green and Mihail introduced the Joint Degree Matrix (JDM)
model to capture the fundamental difference in assortativity of networks in
nature studied by the physical and life sciences and social networks studied in
the social sciences. In 2014 Czabarka proposed a direct generalization of the
JDM model, the Partition Adjacency Matrix (PAM) model. In the PAM model the
vertices have specified degrees, and the vertex set itself is partitioned into
classes. For each pair of vertex classes the number of edges between the
classes in a graph realization is prescribed. In this paper we apply the new
{\em skeleton graph} model to describe the same information as the PAM model.
Our model is more convenient for handling problems with low number of partition
classes or with special topological restrictions among the classes. We
investigate two particular cases in detail: (i) when there are only two vertex
classes and (ii) when the skeleton graph contains at most one cycle.Comment: 19 page
Computing the Zero Forcing Number for Generalized Petersen Graphs
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vertex of G, and exactly one neighbor v of u be white. Then change the color of v to black. When this rule is applied, we say u forces v, and write u ® v . A zero forcing set of a graph G is a subset Z of vertices such that if initially the vertices in Z are colored black and remaining vertices are colored white, the entire graph G may be colored black by repeatedly applying the color-change rule. The zero forcing number of G, denoted Z(G), is the minimum size of a zero forcing set.In this paper, we investigate the zero forcing number for the generalized Petersen graphs (It is denoted by P(n,k)). We obtain upper and lower bounds for the zero forcing number for P(n,k). We show that Z(P(n,2))=6 for n ³ 10, Z(P(n,3))=8 for n ³ 12 and Z(P(2k+1,k))=6 for k ³ 5
Bond-Propagation Algorithm for Thermodynamic Functions in General 2D Ising Models
Recently, we developed and implemented the bond propagation algorithm for
calculating the partition function and correlation functions of random bond
Ising models in two dimensions. The algorithm is the fastest available for
calculating these quantities near the percolation threshold. In this paper, we
show how to extend the bond propagation algorithm to directly calculate
thermodynamic functions by applying the algorithm to derivatives of the
partition function, and we derive explicit expressions for this transformation.
We also discuss variations of the original bond propagation procedure within
the larger context of Y-Delta-Y-reducibility and discuss the relation of this
class of algorithm to other algorithms developed for Ising systems. We conclude
with a discussion on the outlook for applying similar algorithms to other
models.Comment: 12 pages, 10 figures; submitte
- …