A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges
type: Item
instance of: scholarly article
title: A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges
zbMATH Open document ID: 1225.05134
author: Peng Cheng
author: Shigeru Masuyama
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 5703765
zbMATH Keywords: connected spanning subgraphs
zbMATH Keywords: unimodal sequence
zbMATH Keywords: log concave sequence
zbMATH Keywords: network reliability polynomial
MaRDI profile type: Publication
full work available at URL: j.dam.2009.11.008
OpenAlex ID: W2017061446
cites work: An extension of a criterion for unimodality
cites work: Q4320807
cites work: Q4248175
cites work: Q4301917
cites work: Q3043192
cites work: Parallel concepts in graph theory
cites work: Chromatic polynomials and logarithmic concavity
cites work: Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials
cites work: Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
cites work: Q3135082
cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: An introduction to chromatic polynomials
cites work: Q3819084
cites work: Q4294628
cites work: Q5641146
DOI: 10.1016/J.DAM.2009.11.008
Recommended article: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
Recommended article: Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges
Recommended article: Q6172114
Recommended article: On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
Recommended article: On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
Recommended article: The number of connected sparsely edged uniform hypergraphs
Recommended article: On the sum-connectivity index of unicyclic graphs with \(k\) pendent vertices
Recommended article: Q3411645
Recommended article: On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
Recommended article: On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices
description: scientific article; zbMATH DE number 5703765