Results 31 to 40 of about 91 (88)
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
A digital Jordan surface theorem with respect to a graph connectedness
Open Mathematics, 2023 After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z{\mathbb{Z}} with a certain set of paths of length nn for every positive integer nn.
Šlapal Josef
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
Existence of Regular Nut Graphs for Degree at Most 11
Discussiones Mathematicae Graph Theory, 2020 A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
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
Open Mathematics, 2018 The problem of structures learning in Bayesian networks is to discover a directed acyclic graph that in some sense is the best representation of the given database. Score-based learning algorithm is one of the important structure learning methods used to
Wang Jingyun, Liu Sanyang
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
On dynamic network security: A random decentering algorithm on graphs
Open Mathematics, 2018 Random Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation ...
Trobajo M.T. +2 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