Skip to search formSkip to main contentSkip to account menu

Bollobás–Riordan polynomial

Known as: Bollobás-Riordan polynomials, Bollobás–Riordan polynomials, Bollobas–Riordan polynomial 
The Bollobás–Riordan polynomial can mean a 3-variable invariant polynomial of graphs on orientable surfaces, or a more general 4-variable invariant… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Invariant polynomialTutte polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Tutte polynomial for non-orientable maps
2016
2016
UNORIENTED FIRST-PASSAGE PERCOLATION ON THE n-CUBE BY ANDERS MARTINSSON
  • 2016
  • Corpus ID: 265100342
The n-dimensional binary hypercube is the graph whose vertices are the binary n-tuples {0,1}n and where two vertices are… 
2015
2015
Spectral Thinning in GLD Lattices
This paper deals with generalized low-density (GLD) lattices which have been recently shown to be an excellent family of lattices… 
2013
2013
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
Two n‐vertex hypergraphs G and H pack, if there is a bijection f:V(G)→V(H) such that for every edge e∈E(G) , the set {f(v):v∈e… 
2011
2011
A Comprehensive Study of the RL Series Resonant Shunted Piezoelectric: A Feedback Controls Perspective
The resonant shunted piezoelectric has been shown a viable solution for stable vibration control. Two main implementations of the… 
2011
2011
Decompositions of graphs into a given clique-extension
For r ≥ 3, a clique-extension of order r + 1 is a connected graph that consists of a Kr plus another vertex adjacent to at most r… 
2009
2009
Applications of quark-hadron duality in the F-2 structure function
Inclusive electron-proton and electron-deuteron inelastic cross sections have been measured at Jefferson Lab (JLab) in the… 
2009
2009
On the best constant in the weak type inequality for the square function of a conditionally symmetric martingale
2007
2007
Approximate zero-one laws and sharpness of the percolation transition in a class of models including 2D Ising percolation
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words… 
2006
2006
A new class of scale free random graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)