Results 21 to 30 of about 310,757 (283)
On Certain Types of Neutrosophic Fuzzy Graphs
Pan-American Journal of Mathematics, 2022 In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj +1 more source
On a preferential attachment and generalized P\'{o}lya's urn model [PDF]
, 2013 We study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex.
Collevecchio, Andrea +2 more
core +3 more sources
Random Graphs' Robustness in Random Environment
Austrian Journal of Statistics, 2017 We consider configuration graphs the vertex degrees of which are independent and follow the power-law distribution. Random graphs dynamics takes place in a random environment with the parameter of vertex degree distribution following uniform ...
Marina Leri, Yury Pavlov
doaj +1 more source
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Generalized Zagreb index of product graphs [PDF]
Transactions on Combinatorics, 2019 The generalized Zagreb index is an extension of both ordinary and variable Zagreb indices. In this paper, we present exact formulae for the values of the generalized Zagreb index for product graphs.
Mahdieh Azari
doaj +1 more source
Bose-Einstein condensation in random directed networks [PDF]
, 2003 We consider the phenomenon of Bose-Einstein condensation in a random growing directed net- work. The network grows by the addition of vertices and edges. At each time step the network gains a vertex with probabilty p and an edge with probability 1 − p.
Rodgers, GJ, Sotolongo-Costa, O
core +2 more sources
On Triangulations with High Vertex Degree [PDF]
Annals of Combinatorics, 2008 We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
openaire +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 The two Zagreb indices and are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of and were put forward. The present survey of these modified
Ivan Gutman +2 more
doaj +1 more source
Vertex arboricity and maximum degree
Discrete Mathematics, 1995 This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
Catlin, Paul A., Lai, Hong-Jian
openaire +1 more source
Fuzzy Graph Structures with Application
Mathematics, 2019 In this article, we introduce the notions of maximal products of fuzzy graph structures, regular fuzzy graph structures, and describe these notions with examples and properties.
Muzzamal Sitara +2 more
doaj +1 more source