Handle bases and bounds on the number of subgraphs
From MaRDI portal
Publication:1087883
DOI10.1016/0095-8956(87)90058-XzbMATH Open0612.05035OpenAlexW2032045362MaRDI QIDQ1087883FDOQ1087883
Authors: B. George 
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90058-x
Recommendations
- Bounds on the number of complete subgraphs
- Bounds for the number of mappings of graphs and for the number of subgraphs
- Upper bounds for the \(k\)-subdomination number of graphs
- On the number of certain subgraphs contained in graphs with a given number of edges
- scientific article; zbMATH DE number 3188526
- On the number of connected subgraphs of graphs
- Counting subgraphs via homomorphisms
- Counting Subgraphs via Homomorphisms
- scientific article; zbMATH DE number 812041
- scientific article
Directed graphs (digraphs), tournaments (05C20) Determinants, permanents, traces, other special matrix functions (15A15) Paths and cycles (05C38)
Cites Work
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- On minimal elementary bipartite graphs
- An Upper Bound for the Permanent of a Fully Indecomposable Matrix
- Title not available (Why is that?)
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
- Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
Cited In (2)
This page was built for publication: Handle bases and bounds on the number of subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087883)
