Results 21 to 30 of about 193 (188)
Theoretical Computer Science, 2011 Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). In this paper, we study how the asynchronism and the graph act upon the dynamics of the classical Minority rule.
Regnault, Damien +2 more
openaire +6 more sources
Stack and Queue Layouts via Layered Separators
Journal of Graph Algorithms and Applications, 2018 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not
Vida Dujmović, Fabrizio Frati
doaj +1 more source
The probability of planarity of a random graph near the critical point [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Erdős and Rényi conjectured in 1960 that the limiting probability $p$ that a random graph with $n$ vertices and $M=n/2$ edges is planar exists. It has been shown that indeed p exists and is a constant strictly between 0 and 1.
Marc Noy +2 more
doaj +1 more source
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinhard Diestel, Daniela Kühn
openaire +2 more sources
Graph Minors and Minimum Degree [PDF]
The Electronic Journal of Combinatorics, 2010 Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite family of minor-minimal forbidden graphs, which we denote by $\widehat{\mathcal{D}}_k$.
Gasper Fijavz, David R. Wood
openaire +3 more sources
The Scientific World Journal, 2014 An n×n matrix is called an N0-matrix if all its specified principal minors are nonpositive. In the context of partial matrices, a partial matrix is called a partial N0-matrix if all its specified principal minors are nonpositive.
Cristina Jordán, Juan R. Torregrosa
doaj +1 more source
Inverse Eigenvalue Problems for Two Special Acyclic Matrices
Mathematics, 2016 In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix
Debashish Sharma, Mausumi Sen
doaj +1 more source
Stem Cell Research & Therapy, 2021 Background We explored whether stem cell therapy was effective for animal models and patients with Crohn’s disease (CD). Methods We searched five online databases. The relative outcomes were analyzed with the aid of GetData Graph Digitizer 2.26 and Stata
Ruo Wang +7 more
doaj +1 more source
on the number of cliques and cycles in graphs [PDF]
Transactions on Combinatorics, 2013 We give a new recursive method to compute the number of cliques and cycles of a graph. This method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the ...
Mojgan Emami, Masoud Ariannejad
doaj
Graph minors and the crossing number of graphs
Electronic Notes in Discrete Mathematics, 2007 Abstract There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leighton's work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.
Drago Bokal +3 more
openaire +1 more source