Results 81 to 90 of about 238 (93)

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]

Heliyon
Dehgardi N, Azari M, Shang Y.
europepmc   +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

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

On the minimal length of the longest trail in a fixed edge-density graph

Open Mathematics, 2013
Szécsi Vajk
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Maximum Size of C≤ k-Free Strong Digraphs with Out-Degree at Least Two

Social Science Research Network, 2022
: Let H be a family of digraphs. A digraph D is H -free if it contains no isomorphic copy of any member of H . For k ≥ 2, we set C ≤ k = { C 2 , C 3 , . . . , C k } , where C (cid:96) is a directed cycle of length (cid:96) ∈ { 2 , 3 , . . . , k } . Let D
Bin Chen, Xinmin Hou
semanticscholar   +1 more source

The second largest number of maximum independent sets in trees of odd order without duplicated leaves

Applied Mathematical Sciences, 2021
In a graph G = (V,E), an independent set is a subset I of V (G) such that no two vertices in I are adjacent. A maximum independent set is an independent set of maximum size.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar   +1 more source