Results 1 to 10 of about 70 (68)
An extremal problem on potentially K_p,1,1-graphic sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A sequence S is potentially K_p,1,1 graphical if it has a realization containing a K_p,1,1 as a subgraph, where K_p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj +1 more source
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
Open Chemistry, 2021 In recent years, several structure-based properties of the molecular graphs are understood through the chemical graph theory. The molecular graph GG of a molecule consists of vertices and edges, where vertices represent the atoms in a molecule and edges ...
Zhao Dongming +6 more
doaj +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
Upward-closed hereditary families in the dominance order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets within the ...
Michael D. Barrus, Jean A. Guillaume
doaj +1 more source
Hosoya properties of the commuting graph associated with the group of symmetries
Main Group Metal Chemistry, 2021 A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
Eccentric topological properties of a graph associated to a finite dimensional vector space
Main Group Metal Chemistry, 2020 A topological index is actually designed by transforming a chemical structure into a number. Topological index is a graph invariant which characterizes the topology of the graph and remains invariant under graph automorphism.
Liu Jia-Bao +5 more
doaj +1 more source
The H-force sets of the graphs satisfying the condition of Ore’s theorem
Open Mathematics, 2020 Let G be a Hamiltonian graph. A nonempty vertex set X⊆V(G)X\subseteq V(G) is called a Hamiltonian cycle enforcing set (in short, an H-force set) of G if every X-cycle of G (i.e., a cycle of G containing all vertices of X) is a Hamiltonian cycle.
Zhang Xinhong, Li Ruijuan
doaj +1 more source
On kernels by rainbow paths in arc-coloured digraphs
Open Mathematics, 2021 In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no ...
Li Ruijuan, Cao Yanqin, Zhang Xinhong
doaj +1 more source
Equating κ Maximum Degrees in Graphs without Short Cycles
Discussiones Mathematicae Graph Theory, 2020 For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k.
Fürst Maximilian +4 more
doaj +1 more source
Solutions to problems about potentially Ks,t-bigraphic pair
Open Mathematics, 2022 Let S=(a1,…,am;b1,…,bn)S=\left({a}_{1},\ldots ,{a}_{m};\hspace{0.33em}{b}_{1},\ldots ,{b}_{n}), where a1,…,am{a}_{1},\ldots ,{a}_{m} and b1,…,bn{b}_{1},\ldots ,{b}_{n} are two nonincreasing sequences of nonnegative integers. The pair S=(a1,…,am;b1,…,bn)S=
Yin Jian-Hua, Zhang Liang
doaj +1 more source