Results 21 to 30 of about 18,692 (262)
Minimum Vertex Degree Threshold for ‐tiling* [PDF]
Journal of Graph Theory, 2014 AbstractWe prove that the vertex degree threshold for tiling (the 3‐uniform hypergraph with four vertices and two triples) in a 3‐uniform hypergraph on vertices is , where if and otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling.
Jie Han, Yi Zhao
openaire +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
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
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
Degree distance and vertex-connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali, P., Mukwembi, S., Munyira, S.
openaire +2 more sources
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
Random graphs with forbidden vertex degrees [PDF]
Random Structures & Algorithms, 2010 AbstractWe study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset $ {\cal S} $ of the nonnegative integers. Subject to a certain hypothesis on $ {\cal S} $, the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter $ \hat{\mu} $ given as the root of a certain ...
Grimmett, Geoffrey, Janson, Svante
openaire +3 more sources
Frontiers in PhysicsIn this article, a quantitative structure-property relationship is performed for the prediction of six physico-chemical properties of 16 alkaloid structures using three different types of degree-based topological indices.
Muhammad Waheed Rasheed +2 more
doaj +1 more source