Results 291 to 300 of about 2,991,925 (319)
Some of the next articles are maybe not open access.

On Planar Graphical Degree Sequences

SIAM Journal on Applied Mathematics, 1977
We determine completely which graphical sequences $d_1 \geqq d_2 \geqq \cdots \geqq d_p $ with $d_1 - d_p = 1$ are planar graphical, and with a small number of exceptions determine the same result when $d_1 - d_p = 2$.We also give simple necessary conditions (in the form of upper bounds on $\sum\nolimits_{i = 1}^k {di} $) for a graphical sequence to be
E. F. Schmeichel, S. L. Hakimi
openaire   +2 more sources

Line‐graphical degree sequences

Journal of Graph Theory, 1980
AbstractA degree sequence π = (d1, d2,…,dp), with d1 ≥ d2 ≥…≥ dp, is line graphical if it is realized by the line graph of some graph. Degree sequences with line‐graphical realizations are characterized for the cases d1 = p ‐ 1, d1 = p ‐ 2, d1 ≤ 3, and d1 = dp.
openaire   +2 more sources

Degrees of types and independent sequences

Journal of Symbolic Logic, 1983
The theories considered here are countable and complete, and the types are all complete too. Let T be an L-theory. A sequence σ = (σn(ν))n∈ω of L-formulas is said to be independent (with respect to T) if for each α ∈ 2<ω, the sentenceis in T. As an example, let T = Th(Z, +), and let σ be the sequence of formulas saying (in the language of groups) ν ...
openaire   +3 more sources

Enumeration of graphs by degree sequence

Journal of Graph Theory, 1979
AbstractThe degree sequence (d0, d1, …, dp‐1) of a graph G of order p is defined by dk = the number of points of G of degree k. Methods of Robinson are extended to produce a generating function F(x0, x1, x2, …) where the coefficient of x…x is the number of graphs of order p having degree sequence (d0, …, dp‐1).
openaire   +2 more sources

Subgraphs and Their Degree Sequences of a Digraph

Journal of the Franklin Institute, 1980
Abstract The paper presents general conditions that are necessary and sufficient for the existence of a (p,s) subgraph with prescribed degrees of a given digraph. It is shown that the subgraph problem of a digraph, the degree sequence problem of a digraph, the subgraph problem of a graph and the degree sequence problem of a graph can all be treated ...
openaire   +3 more sources

Cancer epigenetics in clinical practice

Ca-A Cancer Journal for Clinicians, 2023
Veronica Davalos, Manel Esteller
exaly  

Planning for post‐pandemic cancer care delivery: Recovery or opportunity for redesign?

Ca-A Cancer Journal for Clinicians, 2021
Pelin Cinar   +2 more
exaly  

Graphs and degree sequences. I

Cybernetics, 1988
Zh. A. Chernyak   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy