Results 71 to 80 of about 104 (103)
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
Harary index of the zero divisor graph of upper triangular matrices. [PDF]
Sci RepAlshanqiti O, Sharma S, Bhat VK.
europepmc +1 more source
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 Nagoor Gani A, Latha SR.
europepmc +1 more source
Spanning Star Trees In Regular Graphs
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G,
Jerrold W. Grossman
core
Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment. [PDF]
Bull Math BiolRichman DH, Zhang C, Matsen FA.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
FR3D: finding local and composite recurrent structural motifs in RNA 3D structures. [PDF]
J Math Biol, 2008 Sarver M +4 more
europepmc +1 more source
Arboreal networks and their underlying trees. [PDF]
J Math BiolHuber KT, Overman D.
europepmc +1 more source
Quantifying the difference between phylogenetic diversity and diversity indices. [PDF]
J Math BiolBordewich M, Semple C.
europepmc +1 more source