Some results on graph parameters in weighted graphs

Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann

doi:10.1016/S1571-0653(05)80132-5

Some results on graph parameters in weighted graphs

Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann

Research output: Contribution to journal › Article › peer-review

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)	85-88
Number of pages	4
Journal	Electronic Notes in Discrete Mathematics
Volume	5
DOIs	https://doi.org/10.1016/S1571-0653(05)80132-5
Publication status	Published - Jul 2000
Externally published	Yes

Keywords

Domination
Edge Cover;
Matching;
Weighted graph;

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S1571-0653(05)80132-5

Cite this

@article{14e3ccf59db04464a6f37a3bb78a496c,

title = "Some results on graph parameters in weighted graphs",

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{\"o}nig [7], and Nordhaus-Gaddum type inequalities will be presented.",

keywords = "Domination, Edge Cover;, Matching;, Weighted graph;",

author = "Peter Dankelmann and Dieter Rautenbach and Lutz Volkmann",

year = "2000",

month = jul,

doi = "10.1016/S1571-0653(05)80132-5",

language = "English",

volume = "5",

pages = "85--88",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Some results on graph parameters in weighted graphs

AU - Dankelmann, Peter

AU - Rautenbach, Dieter

AU - Volkmann, Lutz

PY - 2000/7

Y1 - 2000/7

N2 - 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.

AB - 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.

KW - Domination

KW - Edge Cover;

KW - Matching;

KW - Weighted graph;

UR - https://www.scopus.com/pages/publications/34247133623

U2 - 10.1016/S1571-0653(05)80132-5

DO - 10.1016/S1571-0653(05)80132-5

M3 - Article

AN - SCOPUS:34247133623

SN - 1571-0653

VL - 5

SP - 85

EP - 88

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Some results on graph parameters in weighted graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this