Handle bases and bounds on the number of subgraphs

DOI10.1016/0095-8956(87)90058-XMaRDI QIDQ1087883zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pathscyclepermanentstrongly connected digraphhandle basis

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Determinants, permanents, traces, other special matrix functions (15A15) Paths and cycles (05C38)

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; zbMATH DE number 4200235

Cites work

• scientific article; zbMATH DE number 3298614 (Why is no real title available?)
• 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
• An Upper Bound for the Permanent of a Fully Indecomposable Matrix
• Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
• On minimal elementary bipartite graphs
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix

Cited in

(2)

• Cell rotation graphs of strongly connected orientations of plane graphs with an application
• Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents

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)