Results 31 to 40 of about 270,997 (279)
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property đŁ is the asymptotically largest edit distance between a graph of density p â [0, 1] and đŁ. Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
d-Path Laplacians and Quantum Transport on Graphs
Mathematics, 2020 We generalize the Schrödinger equation on graphs to include long-range interactions (LRI) by means of the Mellin-transformed d-path Laplacian operators.
Ernesto Estrada
doaj +1 more source
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones Mathematicae Graph Theory, 2016 We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m â„ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source
(Generalized) Incidence and Laplacian-Like Energies
Journal of Mathematics, 2023 In this study, for graph Î with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number Δâ 0,1, we found generalized and improved bounds for the sum of Δ-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj +1 more source
Power domination in Kn\"odel graphs and Hanoi graphs
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varghese, Seethu +2 more
openaire +3 more sources
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences [PDF]
Logical Methods in Computer Science, 2015 Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary function of r and ...
Jakub Gajarsky, Petr Hlineny
doaj +1 more source
Powers of Hamilton cycles in pseudorandom graphs [PDF]
, 2014 We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$ with $|X|\ge ...
A. Johansson +18 more
core +1 more source
Chained graphs and some applications
Applied Network Science, 2021 This paper introduces the notions of chained and semi-chained graphs. The chain of a graph, when existent, refines the notion of bipartivity and conveys important structural information. Also the notion of a center vertex $$v_c$$ v c is introduced. It is
Anna Concas +3 more
doaj +1 more source
Accessibility percolation on Cartesian power graphs
Journal of Mathematical Biology, 2023 AbstractA fitness landscape is a mapping from a space of discrete genotypes to the real numbers. A path in a fitness landscape is a sequence of genotypes connected by single mutational steps. Such a path is said to be accessible if the fitness values of the genotypes encountered along the path increase monotonically. We study accessible paths on random
Benjamin Schmiegelt, Joachim Krug
openaire +4 more sources
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source