Results 31 to 40 of about 258 (43)

A Consistent Histogram Estimator for Exchangeable Graph Models [PDF]

open access: yes, 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  

Fullerenes with the maximum Clar number [PDF]

open access: yes, 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  

No finite $5$-regular matchstick graph exists [PDF]

open access: yes, 2014
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart.
Kurz, Sascha
core  

The rectilinear local crossing number of $K_n$

open access: yes, 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  

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]

open access: yesDiscrete Comput Geom, 2023
Casel K   +4 more
europepmc   +1 more source

Drawing a Graph in a Hypercube

open access: yes, 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

Best match graphs and reconciliation of gene trees with species trees. [PDF]

open access: yesJ Math Biol, 2020
Geiß M   +6 more
europepmc   +1 more source

Minimum triplet covers of binary phylogenetic X-trees. [PDF]

open access: yesJ Math Biol, 2017
Huber KT, Moulton V, Steel M.
europepmc   +1 more source

RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]

open access: yesMultiscale Model Simul, 2018
Heroy S   +4 more
europepmc   +1 more source

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. [PDF]

open access: yesDiscrete Comput Geom, 2017
Godsil C   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy