Article
Licensed
Unlicensed Requires Authentication

Mark sequences in multigraphs

Published/Copyright: May 16, 2007
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 17 Issue 1

An r-digraph is an orientation of a multigraph which has no loops and contains at most r edges between any pair of distinct vertices. We give a simple proof of necessary and sufficient conditions for a sequence of non-negative integers arranged in nondecreasing order to be a sequence of numbers, called marks or r-scores, attached to the vertices of an r-digraph.

Published Online: 2007-05-16
Published in Print: 2007-04-19

Copyright 2007, Walter de Gruyter

Articles in the same Issue

  1. A class of subcritical branching processes with immigration and infinite number of types of particles
  2. Bounds for extremal values of the mean number of cells containing a given number of particles
  3. Limit theorems for the number of solutions of a system of random linear equations belonging to a given set
  4. On the Stein–Tikhomirov method and its applications in nonclassical limit theorems
  5. Shifted products of independent random variables with values in finite groups
  6. Optimal management of two parallel stacks in two-level memory
  7. An upper bound for the number of product-free sets in a class of groups
  8. Mark sequences in multigraphs
  9. Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
  10. Representations over Galois ring of a linear recurring sequence of maximal period over Galois field
https://doi.org/10.1515/DMA.2007.008

Articles in the same Issue

  1. A class of subcritical branching processes with immigration and infinite number of types of particles
  2. Bounds for extremal values of the mean number of cells containing a given number of particles
  3. Limit theorems for the number of solutions of a system of random linear equations belonging to a given set
  4. On the Stein–Tikhomirov method and its applications in nonclassical limit theorems
  5. Shifted products of independent random variables with values in finite groups
  6. Optimal management of two parallel stacks in two-level memory
  7. An upper bound for the number of product-free sets in a class of groups
  8. Mark sequences in multigraphs
  9. Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
  10. Representations over Galois ring of a linear recurring sequence of maximal period over Galois field
Downloaded on 5.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/DMA.2007.008/html
Scroll to top button