Some results on graph parameters in weighted graphs

Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann

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)	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

Cite this

@article{22efd2f7ffb449deaee1128364ad91f0,

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",

language = "English",

volume = "5",

pages = "1--4",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - Some results on graph parameters in weighted graphs

AU - Dankelmann, Peter

AU - Rautenbach, Dieter

AU - Volkmann, Lutz

PY - 2000

Y1 - 2000

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/52849124532

M3 - Article

AN - SCOPUS:52849124532

SN - 1571-0653

VL - 5

SP - 1

EP - 4

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

Other files and links

Fingerprint

Cite this