The asymptotic number of labeled graphs with given degree sequences (Q1255501): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59508819, #quickstatements; #temporary_batch_1704767531357 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0097-3165(78)90059-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997698259 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic Methods in Enumeration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The asymptotic number of non-negative integer matrices with given row and column sums / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:41, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The asymptotic number of labeled graphs with given degree sequences |
scientific article |
Statements
The asymptotic number of labeled graphs with given degree sequences (English)
0 references
1978
0 references
Asymptotic Number of Labeled Graphs
0 references
Given Degree Sequences
0 references
Integer Matrices
0 references
Incidence Matrices
0 references
Inclusion-Exclusion
0 references
