The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
type: Item
instance of: scholarly article
title: The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
zbMATH Open document ID: 0785.05078
DOI: 10.1016/0012-365X(93)90352-T
author: Krystyna T. Balińska
author: Louis V. Quintas
published in: Discrete Mathematics
publication date: 1993-10-24T00:00:00Z
review text: An \(f\)-graph is a graph whose vertices are all of degree no greater than \(f\); an edge-maximal \(f\)-graph is an \(f\)-graph such that adding any edges will make one of the vertices of degree \(f+1\). One can generate random edge-maximal \(f\)-graphs by adding edges randomly, one at a time, until it is an edge-maximal \(f\)-graph. This note lists some of the facts known and problems for the probabilities \(P(m;n;f)=\) the probability that such a randomly generated edge-maximal \(f\)-graph on \(n\) vertices has \(m\) vertices of degree \(<f\).
reviewed by: Gregory Loren McColm
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 423561
zbMATH Keywords: random \(f\)-graphs
zbMATH Keywords: \(f\)-graph
zbMATH Keywords: edge-maximal \(f\)-graph
zbMATH Keywords: vertex degree
zbMATH Keywords: probabilities
MaRDI profile type: MaRDI publication profile
cites work: Q3839985
cites work: Q3682518
cites work: Q5203069
cites work: Q3203052
full work available at URL: 0012-365x(93)90352-t
OpenAlex ID: W2028279712
Recommended article: Q3139773
Recommended article: Q5209828
Recommended article: Q4800125
Recommended article: Degrees in a digraph whose nodes are graphs
Recommended article: A kinetic approach to the random \(f\)-graph process. Paths, cycles and components
description: scientific article; zbMATH DE number 423561