Results 41 to 50 of about 155 (146)
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
The Complexity of Recognizing Tough Cubic Graphs [PDF]
, 1997 We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to show that for any integer t # 1, it is NP-hard to determine if a 3 t-regular graph is t-tough. We conclude with some remarks concerning the complexity of
D. Bauer +7 more
core +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
On characteristic and permanent polynomials of a matrix
Special Matrices, 2017 There is a digraph corresponding to every square matrix over ℂ. We generate a recurrence relation using the Laplace expansion to calculate the characteristic and the permanent polynomials of a square matrix.
Singh Ranveer, Bapat R. B.
doaj +1 more source
Bounds for the smallest $k$-chromatic graphs of given girth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$.
Geoffrey Exoo, Jan Goedgebeur
doaj +1 more source
Discrete Realizations of Contact and Intersection Graphs (Extended Abstract)
, 1998 Known realizations of geometric representations of graphs, like contact, intersection etc., are "continuous", in the sense that the geometric objects are drawn in Euclidean space with real numbers as coordinates.
Urrutia, Jorge +3 more
core +1 more source
Using Decoupled Features for Photorealistic Style Transfer
, 2023 45 pags., 23 figs., 8 algorithms, 1 tab. -- AMS subject classifications. 68Q25, 68R10, 68U05In this work we propose a photo-realistic style transfer method for image and video that is based on vision science principles and on a recent mathematical ...
Javier Portilla +7 more
core +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
Lower and upper bounds of shortest paths in reachability graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 57, Page 3023-3036, 2004., 2004 We prove the following property for safe marked graphs, safe conflict‐free Petri nets, and live and safe extended free‐choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T| − 1) · |T|/2.
P. K. Mishra
wiley +1 more source