๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximum fractional factors in graphs

โœ Scribed by Guizhen Liu; Qinglin Yu; Lanju Zhang

Book ID
108052320
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
247 KB
Volume
20
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fractional acquisition in graphs
Fractional acquisition in graphs
โœ Wenger, Paul S. ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 471 KB
General fractional -factor numbers of gr
General fractional -factor numbers of graphs
โœ Hongliang Lu; Qinglin Yu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

Let G be a graph and f an integer-valued function on V (G). Let h be a function that assigns each edge to a number in [0, 1], such that the f -fractional number of G is the supremum of โˆ‘ eโˆˆE(G) h(e) over all fractional functions h satisfying for every vertex v. In this work, we provide a new formul

Maximum (g,f)-factors of a general graph
Maximum (g,f)-factors of a general graph
โœ William Y.C. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 472 KB

Chen, W. Y. C., Maximum (g, f)-factors of a general graph, Discrete Mathematics 91 (1991) l-7. This paper presents a characterization of maximum (g, f)-factors of a general graph in which multiple edges and loops are allowed. An analogous characterization of the minimum (g,f)-factors of a general gr