𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sequences of graphical invariants

✍ Scribed by Jerzy Topp

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
466 KB
Volume
25
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

For a given graphical invariant K, a sequence (a, , , a,, . . . , a, ) of positive integers is said to be r-feasible if there exists a graph G with distinguished vertices ul, u2, . . . , v, such that T( G) = a. and T( G -u1 -v2 ---v i ) = ai for i = 1, 2, . . . , n . In this paper, we investigate r-feasible sequences for the irredundance, domination, and independence numbers of a graph. 0 7995 John Wiley & Sons, Inc.

πŸ“œ SIMILAR VOLUMES

Line-graphical degree sequences
Line-graphical degree sequences
✍ Douglas Bauer πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 560 KB

A degree sequence rr = (d,, d2, . . . , d,), with d, r d 2 r -\* \* 2 d,, 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 d, = p -I , d, = p -2, d, 5 3 , and d, = d,. It is also shown that if a deg

New 2D graphical representation of DNA s
New 2D graphical representation of DNA sequences
✍ Bo Liao; Tian-Ming Wang πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 2 views

## Abstract We consider a 2D graphical representations of DNA sequences, which avoids loss of information associated with crossing and overlapping of the corresponding curve. We outline an approach, which is based on the construction of a three‐component vector whose components are the normalized l

Graphical approach to analyzing DNA sequ
Graphical approach to analyzing DNA sequences
✍ Bo Liao; Kequan Ding πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract Recently, we proposed a 2D graphical representation of DNA sequence [J Comput Chem 25(2004) 1364–1368]. Based on this representation, we outline one approach to search optimal alignment. We also can judge the mutations between bases and an unknown sequence based on its graph and a known

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