The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
Abstract
This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other related problems, such as when a set of integers is realizable as a connected graph, connected graph without “parallel” elements, separable graph, and nonseparable graph, are considered. The relationship between this problem and the problem of isomers in the organic chemistry is described. A similar problem in weighted graphs is also studied.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Linear graphs and electrical networks
(1961) · Journal of the Franklin Institute · doi:10.1016/0016-0032(61)90712-8 · Cited by 752
Cited by
Towards identity anonymization on graphs
Liu, K., & Terzi, E. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376629 · Cited by 773
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J., & Diaconis, P. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 291
RANDOMIZATION OF PRESENCE–ABSENCE MATRICES: COMMENTS AND NEW ALGORITHMS
Miklós, I., & Podani, J. (2004) · Ecology · doi:10.1890/03-0101 · Cited by 281
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Metadata
- Authors
- Hakimi, S. L.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1962-09
- Volume
- 10
- Issue
- 3
- Pages
- 496-506
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2018480107
- Cited by
- 644
- References
- 1
- FWCI
- 4.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.