Results 91 to 95 of about 234 (95)

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

ON SOME GENERAL NEIGHBORHOOD DEGREE BASED TOPOLOGICAL INDICES

, 2020
Newly 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

, 2015
We show that the zig-zag chain Z3 n of segments of length 3 (see Figure 2) has the minimal ABC index among all polyomino chains with n squares. More generally, we give conditions on the numbers {φij} under which the zig-zag chain Z3 n is an extremal ...
Roberto Cruz, J. Rada
semanticscholar   +1 more source

Double total domination on generalized Petersen graphs

, 2017
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G.
Chengye Zhao, Lin-Su Wei
semanticscholar   +1 more source