On the strength of connectedness of a random graph
From MaRDI portal
Publication:3286851
DOI10.1007/BF02066689zbMath0103.16302OpenAlexW2146162554WikidataQ105487889 ScholiaQ105487889MaRDI QIDQ3286851
Publication date: 1961
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02066689
Related Items
Graph Theoretic Concepts in the Study of Biological Networks, ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH, On connectivity and robustness of random graphs with inhomogeneity, Colorful Hamilton Cycles in Random Graphs, On Stable Systems with Random Structure, Structure properties of a doubly-stochastic process on a network, Optimizing the controllability of arbitrary networks with genetic algorithm, The maintenance of cooperation in multiplex networks with limited and partible resources of agents, Rulers and slaves in a random social group, Analytical and statistical studies of Rodriguez-Velazquez indices, Structural calculations and propagation modeling of growing networks based on continuous degree, Spectral properties of unimodular lattice triangulations, Stolarsky–Puebla Index, CONNECTEDNESS INDEX OF UNCERTAIN GRAPH, Packing Directed Hamilton Cycles Online, Packing Hamilton Cycles Online, An algorithm for finding Hamilton paths and cycles in random graphs, On Random Representable Matroids, Some Introductory Notes on Random Graphs, Partitioning random graphs into large cycles, Enumeration of unlabelled bicolored graphs by degree parities, EMPIRICAL DISTRIBUTIONS OF LAPLACIAN MATRICES OF LARGE DILUTE RANDOM GRAPHS, Some remarks about extreme degrees in a random graph, On the existence of a factor of degree one of a connected random graph, Local diversity-stability of the \(q\)-snapback network model, Connectivity of finite anisotropic random graphs and directed graphs, General compartmental epidemic models, On resilience of connectivity in the evolution of random graphs, Gigantic component in random distance graphs of special form, Spectral distributions of adjacency and Laplacian matrices of random graphs, \(k\)-connectivity of uniform \(s\)-intersection graphs, The giant component after percolation of product graphs, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, The asymptotic connectivity of labelled regular graphs, The birth of the strong components, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Concentration of rainbow \(k\)-connectivity of a multiplex random graph, Gigantic and small components in random distance graphs of special form, Tree components in random distance graphs of special form, On the Connectivity of Random k-th Nearest Neighbour Graphs, Cores of random \(r\)-partite hypergraphs, Geographical embedding of scale-free networks, Parameter identification and synchronization of spatiotemporal chaos in uncertain complex network, Covering algorithms, continuum percolation and the geometry of wireless networks, On factors in random graphs, Survival time of a random graph, One-factor in random graphs based on vertex choice, Boolean dynamics of Kauffman models with a scale-free network, Complex networks exhibit intermittent synchronization, General connectivity distribution functions for growing networks with preferential attachment of fractional power, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Risk-Dependent Centrality in Economic and Financial Networks, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Pancyclic Hamilton cycles in random graphs, A Random Graph Model for Power Law Graphs, Mathematical modeling of the malignancy of cancer using graph evolution, A statistical construction of power-law networks, On the critical probability in percolation, Recent advances in percolation theory and its applications, Recent advances on failure and recovery in networks of networks, Euler index of uncertain random graph: concepts and properties, Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint), Navigation in spatial networks: a survey, A framework of hierarchical attacks to network controllability, The characteristics of cycle-nodes-ratio and its application to network classification, Note on directed proper connection number of a random graph, A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network, Competition and fitness in one-mode collaboration network, Observer-based lag synchronization between two different complex networks, Mixed connectivity properties of random graphs and some special graphs, Unimodular lattice triangulations as small-world and scale-free random graphs, Optimal structure of complex networks for minimizing traffic congestion, The number of sparsely edged labelled Hamiltonian graphs, On Hamilton-cycles of random graphs, Probabilistic methods in group theory, BOOLEAN DELAY EQUATIONS ON NETWORKS IN ECONOMICS AND THE GEOSCIENCES, On the exponential ranking and its linear counterpart, Note on an extremal problem arising for unreliable networks in parallel computing, On the connectivity of random subsets of projective spaces, Diameters of random bipartite graphs, On the degrees of vertices in a bichromatic random graph, Enumeration of smooth labelled graphs, Asymptotic enumeration of sparse 2-connected graphs, Limit distribution for the existence of Hamiltonian cycles in a random graph, How many random edges make a graph Hamiltonian?, On the connectivity of random m-orientable graphs and digraphs, A hierarchy of randomness for graphs, On the strength of connectedness of a random hypergraph, Maker-Breaker Games on Randomly Perturbed Graphs, k-connectivity in random undirected graphs, Clustered and deep echo state networks for signal noise reduction, A betweenness structural entropy of complex networks, Jigsaw percolation: what social networks can collaboratively solve a puzzle?, Asymptotic enumeration of sparse graphs with a minimum degree constraint
Cites Work
