Results 31 to 40 of about 908,664 (294)
Reformulated Zagreb Indices of Some Derived Graphs
Mathematics, 2019 A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties.
Jia-Bao Liu +4 more
doaj +1 more source
Majorization and the number of bipartite graphs for given vertex degrees [PDF]
Transactions on Combinatorics, 2018 The emph{bipartite realisation problem} asks for a pair of non-negative, non-increasing integer lists $a:=(a_1,ldots,a_n)$ and $b:=(b_1,ldots,b_{n'})$ if there is a labeled bipartite graph $G(U,V,E)$ (no loops or multiple edges) such that each vertex ...
Annabell Berger
doaj +1 more source
On clustering of conditional configuration graphs
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed limited random variables. They are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
Limit distributions of vertex degrees in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices.
Irina Chepliukova, Yuri Pavlov
doaj +1 more source
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
Discrete Dynamics in Nature and Society, 2022 The geometric-arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end-vertex degrees of edges of G. Similarly, the arithmetic-geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a
Zainab Alsheekhhussain +3 more
doaj +1 more source
Exact Solutions of a Generalized Weighted Scale Free Network
Journal of Applied Mathematics, 2013 We investigate a class of generalized weighted scale-free networks, where the new vertex connects to m pairs of vertices selected preferentially. The key contribution of this paper is that, from the standpoint of random processes, we provide rigorous ...
Li Tan, Dingyou Lei
doaj +1 more source
On conditional configuration graphs with random distribution of vertex degrees
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016 We consider a configuration graph with N vertices. The degrees of the vertices are drawn independently from a discrete power-law distribution with positive parameter τ . They are equal to the number of each vertex’s numbered semiedges.
Yury Pavlov
doaj +1 more source
Mathematics, 2022 A Multinomial Processing Tree (MPT) is a directed tree with a probability associated with each arc and partitioned terminal vertices. We consider an additional parameter for each arc, a measure such as time. Each vertex represents a process.
Richard Schweickert, Xiaofang Zheng
doaj +1 more source
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
F index of graphs based on four new operations related to the strong product
AKCE International Journal of Graphs and Combinatorics, 2020 For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +1 more source