Results 101 to 110 of about 1,202 (110)
Deep Cliques in Point Sets. [PDF]
Discrete Comput GeomLangerman 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:
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
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
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
ON SOME GENERAL NEIGHBORHOOD DEGREE BASED TOPOLOGICAL INDICES
, 2020Newly developing territories of mathematical chemistry is computational technique to get accurate analytical expressions for various topological indices of different networks.
S. Mondal, Nilanjan De, A. Pal
semanticscholar +1 more source
Extremal polyomino chains of VDB topological indices
, 2015Roberto Cruz, J. Rada
semanticscholar +1 more source
Double total domination on generalized Petersen graphs
, 2017Chengye Zhao, Lin-Su Wei
semanticscholar +1 more source