Mark sequences in digraphs
From MaRDI portal
Publication:2654595
zbMATH Open1185.05075arXivmath/0609128MaRDI QIDQ2654595FDOQ2654595
Authors: Yanyan Li 
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Abstract: A k-digraph is an orientation of a multi-graph that is without loops and contains at most k edges between any pair of distinct vertices. We obtain necessary and sufficient conditions for a sequence of non-negative integers in non-decreasing order to be a sequence of numbers, called marks (k-scores), attached to vertices of a k-digraph. We characterize irreducible mark sequences in k-digraphs and uniquely realizable mark sequences in 2-digraphs.
Full work available at URL: https://arxiv.org/abs/math/0609128
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (14)
- On imbalances in multipartite multidigraphs
- Mark sequences in multipartite multidigraphs
- Mark sequences in multigraphs
- On scores in tournaments
- Mark sets in digraphs
- Mark sequences in bipartite multidigraphs and constructions
- On the scores and degrees in hypertournaments
- Inequalities for marks in digraphs
- Tournaments, oriented graphs and football sequences
- On the Zagreb index of tournaments
- Title not available (Why is that?)
- On mark sequences in bipartite digraphs
- On scores, losing scores and total scores in \(k\)-hypertournaments
- On mark sequences in 2-digraphs
This page was built for publication: Mark sequences in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654595)
