Results 21 to 30 of about 157 (86)
Counting occurrences of 132 in an even permutation
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 25, Page 1329-1341, 2004., 2004 We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of a 132 pattern. It is shown that finding this function for a given r amounts to a routine check of all permutations in 𝔖2r.
Toufik Mansour
wiley +1 more source
Existence of Regular Nut Graphs for Degree at Most 11
Discussiones Mathematicae Graph Theory, 2020 A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 38, Page 1997-2017, 2004., 2004 For an ordered set W = {w1, w2, …, wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k‐vector cW(v) = (d(v, w1), d(v, w2), …, d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct codes with respect to W.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
Redefined Zagreb, Randic, harmonic and GA indices of graphene
, 2017 Graph theory has provided chemist with a variety of useful tools, such as topological indices. A topological index Top(G) of a graph G is a number with the property that for every graph H isomorphic to G, Top(H) = Top(G).
R. P. Kumar, D. S. Nandappa, M. Kanna
semanticscholar +1 more source
ECCENTRICITY BASED ZAGREB INDICES OF COPPER OXIDE CuO
, 2020 Graph theory has much advancement in the field of mathematical chemistry. Recently, chemical graph theory has become very popular among researchers because of its wide applications in mathematical chemistry.
H.-X. Li, A. Q. Baig, M. Azhar
semanticscholar +1 more source
Computing Sanskruti Index of Titania Nanotubes
, 2017 Let G = (V ;E) be a simple connected graph. The Sanskruti index was introduced by Hosamani and defined as S(G) = ∑ uv∈E(G) ( SuSv Su+Sv−2 )3 where Su is the summation of degrees of all neighbors of vertex u in G.
M. S. Sardar +3 more
semanticscholar +1 more source
Intelligent Systems for Structural Damage Assessment
Journal of Intelligent Systems, 2018 This research provides a comparative study of intelligent systems in structural damage assessment after the occurrence of an earthquake. Seismic response data of a reinforced concrete structure subjected to 100 different levels of seismic excitation are ...
Vrochidou Eleni +3 more
doaj +1 more source
Bounds and Complexity for the Tessellation Problem
Matemática Contemporânea, 2017 Given a graph Γ = (V,E), a tessellation T is a partition of V into cliques so that the union of the cliques covers the vertex set V but not necessarily the edge set E. A graph Γ is t-tessellable if we can cover the edge set E with t tessellations.
A. Abreu +7 more
semanticscholar +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
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