✦ LIBER ✦

On forcibly connected graphic sequences

✍ Scribed by S.A. Choudum

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 668 KB
Volume: 96
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90311-o

No coin nor oath required. For personal study only.

✦ Synopsis

Choudum, S.A., On forcibly connected graphic sequences, Discrete Mathematics 96 (1991) 175-W.

A few sufficient conditions for a graphic sequence to be forcibly connected are obtained.

📜 SIMILAR VOLUMES

On forcibly hereditary p-graphical seque

On forcibly hereditary p-graphical sequences

✍ A.A Chernyak; Zh.A Chernyak; R.I Tyshkevich 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 986 KB

Characterizations of forcibly Chordal, forcibly strongly chordal, forcibly interval and forcibly trivially perfect graphical sequences are given. On forcibly hereditary P-graphical sequences 113 Characterizations of forcibly P:graphical se/tuences for hereditary properties P which are major types o

On graphic and 3-hypergraphic sequences

✍ S.A. Choudum 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 285 KB

In this paper we give a necessary condition for a sequence n of integers to be 3-hypergraphic. This necessary condition is on the lines of Erdiis and Gallai conditions for graphic sequences and depends on a function M, defined on n.

On polynomial sequences connected with d

On polynomial sequences connected with differential equations

✍ Walter Warwick Sawyer 📂 Article 📅 1953 🏛 John Wiley and Sons 🌐 English ⚖ 752 KB

An unresolved conjecture on nonmaximal p

An unresolved conjecture on nonmaximal planar graphical sequences

✍ Stefano Fanelli 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 229 KB

In this work it is shown that the E&x nonmaxir:lal sequences, 5S555555555553 755555555555555555 (more briefly 5133' 7'5") are not pl-nar graphical, partly proving an unresolved conjecture by Schmeichel and Hakimi.

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

Coronavirus phylogeny based on 2D graphi

Coronavirus phylogeny based on 2D graphical representation of DNA sequence

✍ Bo Liao; Xuyu Xiang; Wen Zhu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 590 KB

## Abstract A novel coronavirus has been identified as the cause of the outbreak of severe acute respiratory syndrome (SARS). Previous phylogenetic analyses based on sequence alignments show that SARS‐CoVs form a new group distantly related to the other three groups of previously characterized coro