Results 31 to 40 of about 272 (58)
On Farkas Lemma and Dimensional Rigidity of Bar Frameworks [PDF]
, 2014 We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.Comment: First ...
Alfakih, A. Y.
core
An introduction to coding sequences of graphs
, 2016 In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids which ...
Ghosh, Shamik +2 more
core +1 more source
Clique trees of infinite locally finite chordal graphs [PDF]
, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +1 more source
A Consistent Histogram Estimator for Exchangeable Graph Models [PDF]
, 2014 Exchangeable graph models (ExGM) subsume a number of popular network models. The mathematical object that characterizes an ExGM is termed a graphon. Finding scalable estimators of graphons, provably consistent, remains an open issue.
Airoldi, Edoardo M., Chan, Stanley H.
core
Drawing a Graph in a Hypercube
, 2004 A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross.
Wood, David R.
core +2 more sources
Fullerenes with the maximum Clar number [PDF]
, 2014 The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded above by [n/6]-2.
Gao, Yang, Li, Qiuli, Zhang, Heping
core
The rectilinear local crossing number of $K_n$
, 2017 We determine ${\bar{\rm{lcr}}}(K_n)$, the rectilinear local crossing number of the complete graph $K_n$ for every $n$. More precisely, for every $n \notin \{8, 14 \}, $ \[ {\bar{\rm{lcr}}}(K_n)=\left\lceil \frac{1}{2} \left( n-3-\left\lceil \frac{n-3}{3}
Fernández-Merchant, Silvia +1 more
core
Improved bounds for the crossing numbers of Km,n and Kn. [PDF]
Klerk, E. de +4 more
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Circle graphs are quadratically χ‐bounded
Bulletin of the London Mathematical Society, 2021Rose Mccarty
exaly
Hanani--Tutte and Hierarchical Partial Planarity
SIAM Journal on Discrete Mathematics, 2022Marcus Schaefer
exaly