Results 11 to 20 of about 34,294 (314)
Extreme coefficients of Jones polynomials and graph theory [PDF]
Journal of Knot Theory and Its Ramifications, 2002 We find families of prime diagrams of knots with arbitrary extreme coefficients in their Jones polynomials. Some graph theory is presents in connection with this problem, generalizing ideas by Yongju Bae and Morton [4] and giving a positive answer to a question in their paper.
P. M. G. Manchón
openalex +4 more sources
Stateless Quantum Structures and Extremal Graph Theory [PDF]
Reports on Mathematical Physics, 2020 We study hypergraphs which represent finite quantum event structures. We contribute to results of graph theory, regarding bounds on the number of edges, given the number of vertices. We develop a missing one for 3-graphs of girth 4. As an application of the graph-theoretical approach to quantum structures, we show that the smallest orthoalgebra with an
Václav Voràček
openalex +3 more sources
It Is Better to Be Semi-Regular When You Have a Low Degree [PDF]
EntropyWe study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity as well as the full spectrum distribution. For an integer d∈3,7,
Theodore Kolokolnikov
doaj +2 more sources
On tricyclic graphs with maximum atom–bond sum–connectivity index [PDF]
HeliyonThe sum-connectivity, Randić, and atom-bond connectivity indices have a prominent place among those topological indices that depend on the graph's vertex degrees.
Sadia Noureen +5 more
doaj +2 more sources
An extremal problem in graph theory [PDF]
Journal of the Australian Mathematical Society, 1970 G(n;l) will denote a graph of n vertices and l edges. Let f0(n, k) be the smallest integer such that there is a G (n;f0(n, k)) in which for every set of k vertices there is a vertex joined to each of these. Thus for example fo = 3 since in a triangle each pair of vertices is joined to a third.
P. Erdös, Leo Moser
openalex +2 more sources
Extremal Graph Theory for Degree Sequences [PDF]
, 2015 22 pages, 2 figures.
Xiao‐Dong Zhang
openalex +3 more sources
On some extremal problems in graph theory [PDF]
, 1999 In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to one in analysis. We study both weighted and unweighted graphs which are extremal for these invariants.
Dmitry Jakobson, Igor Rivin
openalex +3 more sources
Expanding graphs of the Extremal Graph Theory and expanded platforms of Post Quantum Cryptography [PDF]
Annals of computer science and information systems, 2019 Vasyl Ustimenko +2 more
doaj +3 more sources
Extremal Combinatorics in Geometry and Graph Theory
, 2013 We study a problem in extremal geometry posed by Paul Erdos and George Szekeres in 1935. This problem is to find the smallest positive integer N(n) such that every point set in general position (no three on a line) of N(n) points contains the vertex set of a convex n-gon.
Jonathan E. Beagley
openalex +2 more sources
Problems in extremal graphs and poset theory
, 2018 In this dissertation, we present three different research topics and results regarding such topics. We introduce partially ordered sets (posets) and study two types of problems concerning them-- forbidden subposet problems and induced-poset-saturation problems. We conclude by presenting results obtained from studying vertex-identifying codes in graphs.
Shanise Walker
openalex +5 more sources