sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by
Signed degree sequences and multigraphs
β Scribed by T. S. Michael
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 59 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We give necessary and sufficient conditions for the existence of a signed rβmultigraph with a prescribed signed degree sequence. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 41: 101β105, 2002
π SIMILAR VOLUMES
## Abstract For a signed graph __G__ and function $f: V(G) \rightarrow Z$, a signed __f__βfactor of __G__ is a spanning subgraph __F__ such that sdeg~__F__~(__Ο __)β=β__f__(__Ο __) for every vertex __Ο __ of __G__, where sdeg(__Ο __) is the number of positive edges incident with __v__ less the number o
## Abstract A vertex __v__ of a graph __G__ is called __groupie__ if the average degree __t__~__v__~ of all neighbors of __v__ in __G__ is not smaller than the average degree __t__~__G__~ of __G.__ Every graph contains a groupie vertex; the problem of whether or not every simple graph on β§2 vertice
We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of Katerinis and Fraisse, Hell and Kirkpatrick concerning vertex deleted f -factors are generalized.
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
We show that the number of labeled (n, q)-multigraphs with some specified p vertices of odd degree is asymptotically independent of p and is in fact asymptotically 2'-" times the number of (n, q)-multigraphs. We determine the asymptotic number of (n, q)-multigraphs.