Results 101 to 110 of about 163 (126)

Graphs with given connectivity and their minimum Sombor index having applications to QSPR studies of monocarboxylic acids. [PDF]

Heliyon
Hayat S, Arshad M, Khan A.
europepmc   +1 more source

Getting to the root of the problem: sums of squares for limits of trees. [PDF]

Math Program
Brosch D, Puges D.
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  

Deep Cliques in Point Sets. [PDF]

Discrete Comput Geom
Langerman S, Mydlarz M, Welzl E.
europepmc   +1 more source

A characterization of diameter-2-critical graphs with no antihole of length four

Open Mathematics, 2012
Haynes Teresa, Henning Michael
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On stability of the Erdős–Rademacher problem

Illinois Journal of Mathematics, 2023
József Balogh
exaly  

Graphic sequences that have a realization with large clique number 1991 Mathematics Subject Classification: 05C35, 05C99, 06A06

Journal of Graph Theory, 2000
openaire   +1 more source

Extremal Numbers of Cycles Revisited

American Mathematical Monthly, 2021
David Conlon
exaly