Results 41 to 50 of about 3,967,804 (356)
Limit distributions of vertex degrees in a conditional configuration graph
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
F index of graphs based on four new operations related to the strong product
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
On existence of noncritical vertices in digraphs
Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then there exists a
Nenashev, G. V.
core +1 more source
Editing to a Graph of Given Degrees
We consider the Editing to a Graph of Given Degrees problem that asks for a graph G, non-negative integers d,k and a function \delta:V(G)->{1,...,d}, whether it is possible to obtain a graph G' from G such that the degree of v is \delta(v) for any vertex
Golovach, Petr A.
core +1 more source
Bootstrap Percolation and Diffusion in Random Graphs with Given Vertex Degrees
We consider diffusion in random graphs with given vertex degrees. Our diffusion model can be viewed as a variant of a cellular automaton growth process: assume that each node can be in one of the two possible states, inactive or active. The parameters of
H. Amini
semanticscholar +1 more source
In 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
We consider configuration graphs with N vertices. The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ .
Yury Pavlov
doaj +1 more source
Rectangular Matrix Models and Combinatorics of Colored Graphs
We present applications of rectangular matrix models to various combinatorial problems, among which the enumeration of face-bicolored graphs with prescribed vertex degrees, and vertex-tricolored triangulations.
Akuzawa +41 more
core +2 more sources
Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
We consider two types of random networks grown in blocks. Hooking networks are grown from a set of graphs as blocks, each with a labelled vertex called a hook.
Desmarais, Colin, Holmgren, Cecilia
core +1 more source
The 1-2-3 Conjecture for Hypergraphs [PDF]
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +2 more sources

