Results 251 to 260 of about 196,583,728 (297)
Counting Spinal Phylogenetic Networks. [PDF]
Bull Math BiolFrancis A, Hendriksen M.
europepmc +1 more source
Efficient Hamiltonian, structure and trace distance learning of Gaussian states. [PDF]
Nat CommunFanizza M, Rouzé C, Stilck França D.
europepmc +1 more source
Temporal pole blurring in hippocampal sclerosis reflects seizure-disrupted myelination
Afsharmoqaddam A +13 more
europepmc +1 more source
Degree Distance and Vertex-Connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Mukwembi
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Vertex Arboricity and Vertex Degrees
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Douglas Bauer +2 more
openaire +1 more source
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
Algorithmica, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler +4 more
openaire +3 more sources
On Vertex-Disjoint Cycles and Degree Sum Conditions
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronald J. Gould
exaly +4 more sources
On the Vertex Degree Function of Graphs
Computational and Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das
exaly +4 more sources
Degree sum and vertex dominating paths
Journal of Graph Theory, 2018AbstractA vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. In 1988 H. Broersma [5] stated a result implying that every n‐vertex k‐connected graph G such that contains a vertex dominating path. We provide a short, self‐contained proof of this result and further show that every n‐vertex k‐connected ...
Jill R. Faudree +4 more
openaire +2 more sources