Results 21 to 30 of about 238 (93)
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS
, 2020 Graph embedding is the mapping of a topological structure (guest graph) into another topological structure (host graph) that preserves certain required topological properties and the graph embedding ability reflects how efficiently a parallel algorithm ...
Jiangxia Liu, R. Karthik, S. Kumar
semanticscholar +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
Discussiones Mathematicae Graph Theory, 2023 A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source
Some inequalities for the multiplicative sum Zagreb index of graph operations
, 2015 The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms dG(u)+dG(v) over all edges uv∈E(G) , where dG(u) denotes the degree of the vertex u of G .
M. Azari, A. Iranmanesh
semanticscholar +1 more source
A STUDY OF INERTIA INDICES, SIGNATURE AND NULLITY OF V-PHENYLENIC $[m,n]$
, 2020 A molecular/chemical graph is hydrogen depleted chemical structure in which vertices denote atoms and edges denote the bonds. Topological descriptors are the numerical indices based on the topology of the atoms and their bonds (chemical conformation ...
Zheng-Qing Chu +3 more
semanticscholar +1 more source
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj
COMPUTING SANSKRUTI INDEX OF V-PHENYLENIC NANOTUBES AND NANOTORI
, 2017 Among topological descriptors connectivity topological indices are very important and they have a prominent role in chemistry. One of them is Sanskruti index defined as S(G) = ∑ uv∈E(G)( SuSv Su+Sv−2 ) where Su is the summation of degrees of all ...
Huiyan Jiang +4 more
semanticscholar +1 more source
A note on the k‐domination number of a graph
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 1, Page 205-206, 1990., 1989 The k‐domination number of a graph G = G(V, E), γk(G), is the least cardinality of a set X ⊂ V such that any vertex in VX is adjacent to at least k vertices of X. Extending a result of Cockayne, Gamble and Shepherd [4], we prove that if , n ≥ 1, k ≥ 1 then, , where p is the order of G.
Y. Caro, Y. Roditty
wiley +1 more source
On the discrepancy of coloring finite sets
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 4, Page 825-827, 1990., 1990 Given a subset S of {1, …, n} and a map X : {1, …, n} → {−1, 1}, (i.e. a coloring of {1, …, n} with two colors, say red and blue) define the discrepancy of S with respect to X to be dX(S)=|∑i∈SX(i)| (the difference between the reds and blues on S).
D. Hajela
wiley +1 more source
The upper bounds for multiplicative sum Zagreb index of some graph operations
, 2017 Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Π1(G) and is defined by Π1(G) = ∏ uv∈V (G) (dG(u)+dG(v)) .
Yasar Nacaroglu, A. D. Maden
semanticscholar +1 more source
A regular graph of girth 6 and valency 11
International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 3, Page 561-565, 1986., 1986 Let f(11, 6) be the number of vertices of an (11, 6)‐cage. By giving a regular graph of girth 6 and valency 11, we show that f(11, 6) ≤ 240. This is the best known upper bound for f(11, 6).
P. K. Wong
wiley +1 more source