Results 101 to 110 of about 168 (131)

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

ON MULTIPLICATIVE K BANHATTI INDICES OF LINE GRAPHS

, 2021
B. Manjunath
core   +1 more source

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

Shannon Capacity and Related Graph Invariants for Lexicographic Products. [PDF]

Entropy (Basel)
Sason I.
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  

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

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