Results 41 to 50 of about 446 (89)

Steiner Degree Distance of Two Graph Products

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈Sdeg⁡G(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj   +1 more source

Degree-based topological properties of borophene sheets

open access: yesMain Group Metal Chemistry
This study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali   +3 more
doaj   +1 more source

Metric Dimension of Irregular Convex Triangular Networks

open access: yesAKCE International Journal of Graphs and Combinatorics
Irregular convex triangular networks consist of the interior of a 6-sided convex polygon drawn on the infinite triangular network. Formal description of these applicable networks is provided.
S. Prabhu   +3 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of molecular trees

open access: yesAKCE International Journal of Graphs and Combinatorics
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng   +2 more
doaj   +1 more source

Swapped optical transpose interconnection system: Fault-tolerant resolvability on cycle graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
Within computing and information technology, interconnection systems are often modeled using graphs. A notable example is the swapped Optical Transpose Interconnection System (OTIS).
Anam Rani, Asima Razzaque
doaj   +1 more source

Counting occurrences of 132 in an even permutation

open access: yes, 2002
We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r ...
Mansour, T.
core   +1 more source

Continuum limit for interacting systems on adaptive networks

open access: yesEuropean Journal of Applied Mathematics
The article considers systems of interacting particles on networks with adaptively coupled dynamics. Such processes appear frequently in natural processes and applications.
Sebastian Throm
doaj   +1 more source

Social network analysis by Turiyam graphs. [PDF]

open access: yesBMC Res Notes, 2023
Ganati GA, Repalle VNSR, Ashebo MA.
europepmc   +1 more source

Home - About - Disclaimer - Privacy