Results 151 to 160 of about 2,717 (193)
A scalability study of phylogenetic network inference methods using empirical datasets and simulations involving a single reticulation. [PDF]
BMC Bioinformatics, 2016 Hejase HA, Liu KJ.
europepmc +1 more source
Collective consciousness and its pathologies: understanding the failure of AIDS control and treatment in the United States. [PDF]
Theor Biol Med Model, 2007 Wallace RM +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
Unicyclic Graphs Satisfy Harary′s Conjecture
Canadian Mathematical Bulletin, 1974Ulam in [7] has conjectured that any graph G with p≥3 nodes is uniquely reconstructable from its collection of subgraphs Gi=G-vi, i=1,2, … p. This conjecture has been proved for various finite graphs including regular, Eulerian, unicyclic, separable, trees and cacti.
Arjomandi, E., Corneil, D. G.
openaire +2 more sources
Combinatorial Inversion in Edge-Weighted Unicyclic Graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel A. Jaume, Cristian Panelo
openaire +3 more sources
Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Cvetković, Dragoš, Rowlinson, Peter
openaire +1 more source
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Cvetković, Dragoš, Rowlinson, Peter
openaire +1 more source
Vertex betweenness centrality of corona graphs and unicyclic graphs
2023Summary: The idea of centrality measurements is quite appropriate for determining the important vertices or edges in a network. A vertex in a network may be an important vertex depending on its angle of assumption. There are many centrality measurements to find the characteristics of a vertex in a network. Betweenness centrality is an important variant
Barman, Sambhu Charan +2 more
openaire +1 more source
Unicyclic Graphs with Minimal Energy
Journal of Mathematical Chemistry, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Mathematics Teacher, 1967
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire +1 more source
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire +1 more source
Unicyclic nonintegral sum graphs
Journal of Applied and Industrial Mathematics, 2008A graph G = (V,E) is an integral sum graph if there exists a labeling S(G) ⊂ Z such that V = S(G) and every two distinct vertices u, υ ∈ V are adjacent if and only if u + υ ∈ V. A connected graph G = (V,E) is called unicyclic if |V| = |E|. In this paper two infinite series are constructed of unicyclic graphs that are not integral sum graphs.
openaire +1 more source