77,888 research outputs found
Sequence mixed graphs
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the degree/diameter problem. Thus, our generalized approach gives rise to graphs that have also good ratio order/diameter. Moreover, we propose a general method for obtaining a sequence mixed diagraph by identifying some vertices of certain iterated line digraph. As a consequence, some results about distance-related parameters (mainly, the diameter and the average distance) of sequence mixed graphs are presented.Postprint (author's final draft
The diameter of type D associahedra and the non-leaving-face property
Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in
connection to finite type cluster algebras. Following recent work of L. Pournin
in types and , this paper focuses on geodesic properties of generalized
associahedra. We prove that the graph diameter of the -dimensional
associahedron of type is precisely for all greater than .
Furthermore, we show that all type associahedra have the non-leaving-face
property, that is, any geodesic connecting two vertices in the graph of the
polytope stays in the minimal face containing both. This property was already
proven by D. Sleator, R. Tarjan and W. Thurston for associahedra of type .
In contrast, we present relevant examples related to the associahedron that do
not always satisfy this property.Comment: 18 pages, 14 figures. Version 3: improved presentation,
simplification of Section 4.1. Final versio
Diameter of generalized Petersen graphs
Due to their broad application to different fields of theory and practice,
generalized Petersen graphs have been extensively investigated.
Despite the regularity of generalized Petersen graphs, determining an exact
formula for the diameter is still a difficult problem. In their paper, Beenker
and Van Lint have proved that if the circulant graph has diameter
, then has diameter at least and at most . In this
paper, we provide necessary and sufficient conditions so that the diameter of
is equal to and sufficient conditions so that the diameter of
is equal to Afterwards, we give exact values for the diameter
of for almost all cases of and Furthermore, we show that
there exists an algorithm computing the diameter of generalized Petersen graphs
with running time (log)
Fast Routing Table Construction Using Small Messages
We describe a distributed randomized algorithm computing approximate
distances and routes that approximate shortest paths. Let n denote the number
of nodes in the graph, and let HD denote the hop diameter of the graph, i.e.,
the diameter of the graph when all edges are considered to have unit weight.
Given 0 < eps <= 1/2, our algorithm runs in weak-O(n^(1/2 + eps) + HD)
communication rounds using messages of O(log n) bits and guarantees a stretch
of O(eps^(-1) log eps^(-1)) with high probability. This is the first
distributed algorithm approximating weighted shortest paths that uses small
messages and runs in weak-o(n) time (in graphs where HD in weak-o(n)). The time
complexity nearly matches the lower bounds of weak-Omega(sqrt(n) + HD) in the
small-messages model that hold for stateless routing (where routing decisions
do not depend on the traversed path) as well as approximation of the weigthed
diameter. Our scheme replaces the original identifiers of the nodes by labels
of size O(log eps^(-1) log n). We show that no algorithm that keeps the
original identifiers and runs for weak-o(n) rounds can achieve a
polylogarithmic approximation ratio.
Variations of our techniques yield a number of fast distributed approximation
algorithms solving related problems using small messages. Specifically, we
present algorithms that run in weak-O(n^(1/2 + eps) + HD) rounds for a given 0
< eps <= 1/2, and solve, with high probability, the following problems:
- O(eps^(-1))-approximation for the Generalized Steiner Forest (the running
time in this case has an additive weak-O(t^(1 + 2eps)) term, where t is the
number of terminals);
- O(eps^(-2))-approximation of weighted distances, using node labels of size
O(eps^(-1) log n) and weak-O(n^(eps)) bits of memory per node;
- O(eps^(-1))-approximation of the weighted diameter;
- O(eps^(-3))-approximate shortest paths using the labels 1,...,n.Comment: 40 pages, 2 figures, extended abstract submitted to STOC'1
On the Metric Dimension for Snowflake Graph
The concept of metric dimension is derived from the resolving set of a graph, that is measure the diameter among vertices in a graph. For its usefulness in diverse fields, it is interesting to find the metric dimension of various classes of graphs. In this paper, we introduce two new graphs, namely snowflake graph and generalized snowflake graph. After we construct these graphs, aided with a lemma about the lower bound of the metric dimension on a graph that has leaves, and manually recognized the pattern, we found that dim(Snow) = 24 and dim(Snow(n,a,b,c)) = n(a+c+1)
- …