On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
From MaRDI portal
Publication:3845889
DOI10.1137/0110037zbMATH Open0109.16501OpenAlexW2018480107WikidataQ89358751 ScholiaQ89358751MaRDI QIDQ3845889FDOQ3845889
Authors: S. Louis Hakimi
Publication date: 1962
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0110037
Cited In (only showing first 100 items - show all)
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- On degree sequences and eccentricities in pseudoline arrangement graphs
- Multigraphic degree sequences and Hamiltonian-connected line graphs
- Construction of Hamiltonian graphs and bigraphs with prescribed degrees
- Graph extensions, edit number and regular graphs
- Extremal problems on components and loops in graphs
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs
- Modulo 5-orientations and degree sequences
- Forman-Ricci curvature and persistent homology of unweighted complex networks
- Arranging apples in an array
- Configuring random graph models with fixed degree sequences
- An algorithm for the construction of the graphs of organic molecules
- Title not available (Why is that?)
- Optimization over degree sequences
- On null 3-hypergraphs
- Leaf realization problem, caterpillar graphs and prefix normal words
- On matching numbers of tree and bipartite degree sequences
- Exactly scale-free scale-free networks
- Nontraceable detour graphs
- A short proof of a theorem on degree sets of graphs
- Characterization of optimal key set protocols
- Approximating shortest connected graph transformation for trees
- Worst-case versus average-case design for estimation from partial pairwise comparisons
- On signed degrees in signed graphs
- The enumeration of graphical partitions
- The condition for a sequence to be potentially \(A_{L,M}\)-graphic
- A note on applying a theorem of Tutte to graphical sequences
- Validation of community robustness
- Degree sequences and majorization
- Non-separable detachments of graphs
- Enumeration of the degree sequences of non-separable graphs and connected graphs
- The complexity of degree anonymization by vertex addition
- Isomorphic factorization of r-regular graphs into r parts
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Rounding in symmetric matrices and undirected graphs
- The game-theoretical modelling of a dynamically evolving network: revisiting the target sequence 111
- Independence number of graphs and line graphs of trees by means of omega invariant
- Spiders can be recognized by counting their legs
- The convex hull of degree sequences of signed graphs
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
- Graphs with given valences
- Algebraic operations on graphs preserving the degree sequence
- Extremal values of the chromatic number for a given degree sequence
- Algorithm for generating graphs of a given partition
- An algorithm to generate tournament score sequences
- Efficiently realizing interval sequences
- Degree realization of undirected graphs in reduced form
- Title not available (Why is that?)
- On the status sequences of trees
- On existence of hypergraphs with prescribed edge degree profile
- On degree sequences of undirected, directed, and bidirected graphs
- New results on degree sequences of uniform hypergraphs
- On the least size of a graph with a given degree set
- On the realization of a (p,s)-digraph with prescribed degrees
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- Hypergraph recovery algorithms from a given vector of vertex degrees
- Enumerating Steiner triple systems
- Some NP-complete problems for hypergraph degree sequences
- Graphic sequences with a realization containing intersecting cliques
- Pairs of sequences with a unique realization by bipartite graphs
- Sequences with a unique realization by simple graphs
- Degree sequence and supereulerian graphs
- Graph colourings and partitions
- Game theoretical modelling of a dynamically evolving network. I: General target sequences
- A family of switch equivalent graphs
- Improving the characterization of P-stability for applications in network privacy
- An intermediate value theorem for the arboricities
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Realizing degree sequences as \(Z_3\)-connected graphs
- On fractional realizations of graph degree sequences
- An extremal problem on group connectivity of graphs
- Estimation of the covariance structure from SNP allele frequencies
- Realizability and uniqueness in graphs
- Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
- On the planarity of regular incidence sequences
- Graphic sequences with a realization containing a union of cliques
- Graphic sequences with a realization containing a generalized friendship graph
- Game theoretical modelling of a dynamically evolving network. II: Target sequences of score 1
- On the discrepancy between two Zagreb indices
- Colour degree matrices of graphs with at most one cycle
- Polytopes, graphs, and complexes
- A multipartite Hajnal-Szemerédi theorem
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A lower bound on the independence number of a graph
- Mathematical tools for the future: graph theory and graphicable algebras
- Graphical sequences of some family of induced subgraphs
- Linear-time certifying algorithms for near-graphical sequences
- Algebraic characterization of graphical degree stability
- Graphic deviation
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- A note on a theorem of Erdős and Gallai
- Independence free graphs and vertex connectivity augmentation
- A degree sequence variant of graph Ramsey numbers
- Degree sequences and graphs with disjoint spanning trees
- The class of 2-multigraphs with a prescribed degree sequence
- Exact sampling of graphs with prescribed degree correlations
This page was built for publication: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3845889)