Results 51 to 60 of about 73 (73)
Large 2P_3-Free Graphs With Bounded Degree
, 1993 Let ex (D; H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is finite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex (D; H) = O(
Douglas B. West, Myung S. Chung
core
Extremal values on Zagreb indices of trees with given distance k-domination number. [PDF]
J Inequal Appl, 2018 Pei L, Pan X.
europepmc +1 more source
On Properties of Distance-Based Entropies on Fullerene Graphs. [PDF]
Entropy (Basel), 2019 Ghorbani M +4 more
europepmc +1 more source
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application. [PDF]
J Inequal Appl, 2017 He J, Liu YM, Tian JK, Liu XH.
europepmc +1 more source
The F-coindex of some graph operations. [PDF]
Springerplus, 2016 De N, Nayeem SM, Pal A.
europepmc +1 more source
Minimum-Loop Realization of Degree Sequences. [PDF]
J Res Natl Bur Stand (1977), 1982 Goldman AJ, Byrd RH.
europepmc +1 more source
Properties of Labeling Methods for Determining Shortest Path Trees. [PDF]
J Res Natl Bur Stand (1977), 1981 Shier DR, Witzgall C.
europepmc +1 more source
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index. [PDF]
HeliyonDehgardi N, Azari M, Shang Y.
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
Some of the next articles are maybe not open access.