Strength and fractional arboricity of complementary graphs
type: Item
instance of: scholarly article
title: Strength and fractional arboricity of complementary graphs
zbMATH Open document ID: 0831.05037
DOI: 10.1016/0012-365X(95)00012-L
author: Hong-Jian Lai
author: Guoqing Weng
published in: Discrete Mathematics
publication date: 1996-02-12T00:00:00Z
review text: Let \(o(G)\) denote the number of components of a graph \(G\). The strength, \(s(G)\), and the fractional arboricity, \(a(G)\), of \(G\) are given by \(s(G) = \min |S |/ (o(G - S) - o(G))\), minimum being taken over all subsets \(S\) of \(E(G)\) with \(o(G - S) > o(G)\), and \(a(G) = \min |E(H) |/ (|V(H) |-o(H))\), minimum being taken over all subgraphs \(H\) with \(|V(H) |> o(H)\), respectively. Nordhaus-Gaddum type inequalities on \(s(G)\) and \(a(G)\) are presented.
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 790549
zbMATH Keywords: strength
zbMATH Keywords: number of components
zbMATH Keywords: fractional arboricity
zbMATH Keywords: Nordhaus-Gaddum type inequalities
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q5422499
cites work: Q3032296
cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids
cites work: Optimal attack and reinforcement of a network
cites work: Q4734775
cites work: Q3139858
cites work: Q3991269
cites work: On Complementary Graphs
cites work: Q3934403
cites work: Q4014300
Recommended article: Fractional arboricity, strength, and principal partitions in graphs and matroids
Recommended article: Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
Recommended article: Arboricity and complement of a graph
Recommended article: Fractional Vertex Arboricity of Graphs
Recommended article: On linear vertex‐arboricity of complementary graphs
Recommended article: Fractional dominations and fractional total dominations of graph complements
Recommended article: Q4379753
Recommended article: On the Strongly Connected and Biconnected Components of the Complement of Graphs
Recommended article: Q4529265
Recommended article: A Result on the Strength of Graphs by Factorizations of Complete Graphs
description: scientific article; zbMATH DE number 790549