Abstract
A weighted graph (G, w) is a graph G = (V(G), E(G)) together with a real-valued weight-function on its vertices w:V(G) → R. We will define and study generalizations of the matching number, the edge covering number and the domination number for weighted graphs. Generalizations of well-known theorems due to Gallai [5], König [7], and Nordhaus-Gaddum type inequalities will be presented.
Original language | English |
---|---|
Pages (from-to) | 1-4 |
Number of pages | 4 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 5 |
Publication status | Published - 2000 |
Externally published | Yes |
Keywords
- Domination
- Edge Cover
- Matching
- Weighted graph
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics