Results 31 to 40 of about 116 (110)
On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs
Discussiones Mathematicae Graph Theory, 2022 Let D be a strong digraph. An arc subset S is a k-restricted arc cut of D if D − S has a strong component D′ with order at least k such that D\V (D′) contains a connected subdigraph with order at least k.
Zhang Yaoyao, Meng Jixiang
doaj +1 more source
Location of zeros for the partition function of the Ising model on bounded degree graphs
Journal of the London Mathematical Society, Volume 101, Issue 2, Page 765-785, April 2020., 2020 Abstract The seminal Lee–Yang theorem states that for any graph the zeros of the partition function of the ferromagnetic Ising model lie on the unit circle in C. In fact, the union of the zeros of all graphs is dense on the unit circle. In this paper, we study the location of the zeros for the class of graphs of bounded maximum degree d⩾3, both in the ...
Han Peters, Guus Regts
wiley +1 more source
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
Discussiones Mathematicae Graph Theory, 2017 A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices.
Baudon Olivier +3 more
doaj +1 more source
Super edge-connectivity and matching preclusion of data center networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks.
Huazhong Lü, Tingzeng Wu
doaj +1 more source
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix [PDF]
Logical Methods in Computer Science, 2020 This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect ...
Lê Thành Dũng Nguyên
doaj +1 more source
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$.
Stefan Felsner, Daniel Heldt
doaj +1 more source