The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of p-point, ¢-line graphs with prescribed minimum degree and line connectivity. ... We define a (p,q,7,0) graph as a graph having p points, q lines, line connectivity 2 and minimum degree 0. ...
For brevity, we say that a p, q graph is one with p points and q lines. ... In addition to finding the maximum connectivity of any graph with a given number of points and lines, we also obtain the minimum connectivity, the maximum diameter, and the minimum diameter. ... For brevity, we say that a p, q graph is one with p points and q lines. ...doi:10.1073/pnas.48.7.1142 pmid:16590970 pmcid:PMC220921 fatcat:uu46hrk6lrgmbn7iz5wytcbcy4
Summary: “We define a (p,g,4,A) graph as a graph having p points, q lines, line connectivity 4, and maximum degree A. ... degree and line connectivity or minimum degree. ...
L. 84d:05114 Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. Networks 12 (1982), no. 3, 341-350. ... The lower bounds are expressed in terms of the point connectivity «x, line connectivity A and minimum degree 5 of G. ...
Lecture Notes in Computer Science
As a byproduct of our techniques, we answer a long standing question by Garg and Tamassia about the angular resolution of the planar straight-line drawings of series-parallel graphs of bounded degree. ... We prove tight bounds (up to a small multiplicative or additive constant) for the plane and the planar slope numbers of partial 2-trees of bounded degree. ... A plane graph is a planar graph together with a combinatorial embedding, i.e. a prescribed set of faces including a prescribed outer face. ...doi:10.1007/978-3-319-03841-4_36 fatcat:aizqfijgnjfajgqz6b2irafuaa
It consists of an initialization phase with the network extending tree-like for minimum cost and a growth phase with an attachment rule giving a trade-off between cost-optimization and redundancy. ... In particular, the mean degree and the slope of the exponential decay can be controlled in partial independence. ... ) andγ (dashed) for realizations with different mean degree k and (d) same as in (c) for realizations with different q. ...doi:10.1140/epjst/e2014-02279-6 fatcat:zlogcl3kmngfli7nreo7yva6cm
We study straight-line drawings of planar graphs with prescribed face areas. ... A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. ... Acknowledgements I thank Udo Hoffmann and Sven Jäger for helpful comments. Area-universal triangulations ...arXiv:1808.10864v2 fatcat:w4twuzrecvaxrmidkveh75dqzu
Very littlv Soviet work has been reported on connectivity propertieb of graphs, matroid theory, the exact enumeration of graphs having prescribed properties, isomorphism testing, graph coloring, and the ... The best Sovic work has been concerned with bounds on numerical indices associated with graphs, properties of algebraic stvuctures associated with graphs, and operations on graphs. ... Each step of the decomposition 1) locates a point p of degree 1 whose adjacent point is, say, q and (2) removes the points p and q and all edges incident at point q. ...doi:10.1111/j.1749-6632.1970.tb56496.x fatcat:cbb5x22w2farrnw5sijyovn66i
Formula (11) then tells us that P* and Q* are of degree 8. ... Here, we may pose a converse type of question: For a given (local or global) topological structure, what is the minimum degree of polynomial system which realizes it? ... This has been established by Kaplan [ 161 for flows with no critical points, and extended by Boothby  to the case in which all critical points are of purely hyperbolic type. ...doi:10.1016/0022-0396(81)90034-6 fatcat:wywjfdmhovhinkozhrjp2uw4sa
Lecture Notes in Computer Science
We show that every planar graph has a smooth planar 3-Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings. ... In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. ... This research was supported in part by the National Science Foundation under grants CCF-0830403, CCF-0545743, and CCF-1115971, by the Office of Naval Research under MURI grant N00014-08-1-1015, and by ...doi:10.1007/978-3-642-25878-7_30 fatcat:bqduoxtwsbfrvb4twkpozwdu5a
Exponential random graphs are important to model the structure of real-world complex networks. Here we solve the two-star model with degree-degree correlations in the sparse regime. ... The model constraints the average correlation between the degrees of adjacent nodes (nearest neighbors) and between the degrees at the end-points of two-stars (next nearest neighbors). ... The model allows to generate random graphs with prescribed degree correlations between adjacent nodes and between nodes at the end-points of two-stars. ...arXiv:2102.09629v1 fatcat:t4pvhq6klva2dkfgnxd6tylbsu
This algorithmic framework decouples the geometric information (exact location of edges and nodes) from the metric topology (connectivity and edge weight) and it ultimately allows us to perform a quantitative ... statistical comparison between predictions of theoretical models and naturally occurring loopy graphs. ... Daly from the New York Botanical Garden for kindly providing us with cleared leaf images, and P. ...doi:10.1371/journal.pone.0037994 pmid:22701593 pmcid:PMC3368948 fatcat:tlqnosqooneklkifs2ylozj54i
We show that, under appropriate conditions, the topology given by the nonbipartite Ramanujan graphs optimizes the convergence rate of this distributed algorithm. ... We consider iterative distributed inference with local intersensor communication, which, under simplifying assumptions, is equivalent to distributed average consensus. ... The LPS-II graphs are Cayley graphs over the group P 1 (F q ) = f0; 1; . . . ; q 01; 1g, called the Projective line over F q , 4 and which is basically the set of integers modulo q, with an additional ...doi:10.1109/tsp.2008.923536 fatcat:dgkw6yyovzabxfq4os6kno4uc4
The dimension of a partial order P is the minimum number of linear orders whose intersection is P . There are efficient algorithms to test if a partial order has dimension at most 2. ... The height of a partial order P is the maximum size of a chain in P . Yannakakis also showed that for k ≥ 4 to test if a partial order of height 2 has dimension ≤ k is NP-complete. ... The line (p) = p + λ1 shares a point p e with the segmentsê = [û,v ] and a point p f with the segmentf = [x,ŷ ]. Without loss of generality we may assume that p f separates p e and p on (p). ...doi:10.1137/15m1007720 fatcat:yz6lbrji7rduraugowinvau3um
The dimension of a partial order P is the minimum number of linear orders whose intersection is P. There are efficient algorithms to test if a partial order has dimension at most 2. ... The height of a partial order P is the maximum size of a chain in P. Yannakakis also showed that for k≥ 4 to test if a partial order of height 2 has dimension ≤ k is NP-complete. ... The line ℓ(p) = p + λ1 shares a point p e with the segmentsê = [û,v ] and a point p f with the segmentf = [x ,ŷ ]. Without loss of generality we may assume that p f separates p e and p on ℓ(p). ...arXiv:1501.01147v2 fatcat:jecoz3ejmjgz5fsi4zo3zdqwaq
« Previous Showing results 1 — 15 out of 9,844 results