Title of article
Some results on graph parameters in weighted graphs
Author/Authors
Dankelmann، نويسنده , , Peter and Rautenbach، نويسنده , , Dieter and Volkmann، نويسنده , , Lutz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
85
To page
88
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.
Keywords
domination , Weighted graph , Matching , Edge Cover
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452833
Link To Document