Results 21 to 30 of about 971 (113)
A correction on Shiloach's algorithm for minimum linear arrangement of trees [PDF]
, 2017 More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature.
Esteban, Juan Luis +1 more
core +3 more sources
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time
Discussiones Mathematicae Graph Theory, 2022 Let G = (V, E) be a finite undirected graph. An edge subset E′ ⊆ E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E′. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m.
Brandstädt Andreas, Mosca Raffaele
doaj +1 more source
Injectivity results for coarse homology theories
Proceedings of the London Mathematical Society, Volume 121, Issue 6, Page 1619-1684, December 2020., 2020 Abstract We show injectivity results for assembly maps using equivariant coarse homology theories with transfers. Our method is based on the descent principle and applies to a large class of linear groups or, more generally, groups with finite decomposition complexity.
Ulrich Bunke +3 more
wiley +1 more source
Bounds on the Twin-Width of Product Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of the twin ...
William Pettersson, John Sylvester
doaj +1 more source
Weak and Strong Reinforcement Number For a Graph [PDF]
, 2010 Introducing the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number, and giving some boundary of this new parameter and ...
DOGAN, Derya +2 more
core +1 more source
Homotopy type of the complex of free factors of a free group
Proceedings of the London Mathematical Society, Volume 121, Issue 6, Page 1737-1765, December 2020., 2020 Abstract We show that the complex of free factors of a free group of rank n⩾2 is homotopy equivalent to a wedge of spheres of dimension n−2. We also prove that for n⩾2, the complement of (unreduced) Outer space in the free splitting complex is homotopy equivalent to the complex of free factor systems and moreover is (n−2)‐connected.
Benjamin Brück, Radhika Gupta
wiley +1 more source
The hidden symmetry of Kontsevich's graph flows on the spaces of Nambu-determinant Poisson brackets [PDF]
Open Communications in Nonlinear Mathematical Physics, 2022 Kontsevich's graph flows are -- universally for all finite-dimensional affine Poisson manifolds -- infinitesimal symmetries of the spaces of Poisson brackets.
Ricardo Buring +2 more
doaj +1 more source
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
SIAM Journal on Discrete Mathematics, 2005 The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without
Omer Giménez, Petr Hliněný, M. Noy
semanticscholar +1 more source
When products of projections diverge
Journal of the London Mathematical Society, Volume 102, Issue 1, Page 345-367, August 2020., 2020 Abstract Slow convergence of cyclic projections implies divergence of random projections and vice versa. Let L1,L2,⋯,LK be a family of K closed subspaces of a Hilbert space. It is well known that although the cyclic product of the orthogonal projections on these spaces always converges in norm, random products might diverge.
Eva Kopecká
wiley +1 more source
PRIME WEIGHTED GRAPH IN CRYPTOGRAPHIC SYSTEM FOR SECURE COMMUNICATION
, 2015 Cryptography is the study of techniques for ensuring the secrecy and authentication of the information. Public-key encryption schemes are secure only if the authenticity of the public-key is assured.
S. Agarwal, A. Uniyal
semanticscholar +1 more source