Results 61 to 70 of about 131 (96)
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Special Matrices, 2018 Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
The expected loss of feature diversity (versus phylogenetic diversity) following rapid extinction at the present. [PDF]
J Math Biol, 2023 Overwater M, Pelletier D, Steel M.
europepmc +1 more source
Open Mathematics, 2016 As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +1 more source
Enumeration of binary trees compatible with a perfect phylogeny. [PDF]
J Math Biol, 2022 Palacios JA +3 more
europepmc +1 more source
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. [PDF]
Discrete Appl Math, 2021 Rosenberg NA.
europepmc +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
On Accurate Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna +2 more
doaj +1 more source
Boundary behaviour of λ -polyharmonic functions on regular trees. [PDF]
Ann Mat Pura Appl, 2021 Sava-Huss E, Woess W.
europepmc +1 more source
A combinatorial identity for rooted labeled forests. [PDF]
Aequ Math, 2020 Hackl B.
europepmc +1 more source
On Two Generalized Connectivities of Graphs
Discussiones Mathematicae Graph Theory, 2018 The concept of generalized k-connectivity κk(G), mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity.
Sun Yuefang, Li Fengwei, Jin Zemin
doaj +1 more source