Results 31 to 40 of about 294 (70)
Archimedean tiling graphs with Gallai’s property
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 Gallai in 1966 raised the question about the existence of graphs with the property that every vertex is missed by some longest path. This property will be called Gallai’s property.
Chang Zhikui, Yuan Liping
doaj +1 more source
Induced Subgraphs of Johnson Graphs
, 2012 The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements.
Benadé +6 more
core +1 more source
Improved bounds for the crossing numbers of K_m,n and K_n
, 2004 It has been long--conjectured that the crossing number cr(K_m,n) of the complete bipartite graph K_m,n equals the Zarankiewicz Number Z(m,n):= floor((m-1)/2) floor(m/2) floor((n-1)/2) floor(n/2). Another long--standing conjecture states that the crossing
de Klerk, E. +4 more
core +2 more sources
A polynomial algorithm for the k-cluster problem on interval graphs
, 2008 This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well as on chordal ...
Mertzios, George B.
core +1 more source
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
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
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
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
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
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