225 research outputs found
The Irreducible Spine(s) of Undirected Networks
Using closure concepts, we show that within every undirected network, or
graph, there is a unique irreducible subgraph which we call its "spine". The
chordless cycles which comprise this irreducible core effectively characterize
the connectivity structure of the network as a whole. In particular, it is
shown that the center of the network, whether defined by distance or
betweenness centrality, is effectively contained in this spine. By counting the
number of cycles of length 3 <= k <= max_length, we can also create a kind of
signature that can be used to identify the network. Performance is analyzed,
and the concepts we develop are illurstrated by means of a relatively small
running sample network of about 400 nodes.Comment: Submitted to WISE 201
Graphs that do not contain a cycle with a node that has at least two neighbors on it
We recall several known results about minimally 2-connected graphs, and show
that they all follow from a decomposition theorem. Starting from an analogy
with critically 2-connected graphs, we give structural characterizations of the
classes of graphs that do not contain as a subgraph and as an induced subgraph,
a cycle with a node that has at least two neighbors on the cycle. From these
characterizations we get polynomial time recognition algorithms for these
classes, as well as polynomial time algorithms for vertex-coloring and
edge-coloring
Lehmer's conjecture for Hermitian matrices over the Eisenstein and Gaussian integers
We solve Lehmer's problem for a class of polynomials arising from Hermitian
matrices over the Eisenstein and Gaussian integers, that is, we show that all
such polynomials have Mahler measure at least Lehmer's number \tau_0 =
1.17628...
Optimal 3D Angular Resolution for Low-Degree Graphs
We show that every graph of maximum degree three can be drawn in three
dimensions with at most two bends per edge, and with 120-degree angles between
any two edge segments meeting at a vertex or a bend. We show that every graph
of maximum degree four can be drawn in three dimensions with at most three
bends per edge, and with 109.5-degree angles, i.e., the angular resolution of
the diamond lattice, between any two edge segments meeting at a vertex or bend.Comment: 18 pages, 10 figures. Extended version of paper to appear in Proc.
18th Int. Symp. Graph Drawing, Konstanz, Germany, 201
- …