The cube polynomial and its derivatives: The case of median graphs

zbMath1020.05035MaRDI QIDQ1856347

Riste Škrekovski, Boštjan Brešar, Sandi Klavžar

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_10/Abstracts/v10i1r3.html

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Related Items (18)

\(q\)-cube enumerator polynomial of Fibonacci cubes ⋮ Counting hypercubes in hypercubes ⋮ On cube-free median graphs ⋮ Hamming polynomials and their partial derivatives ⋮ Enumerative properties and cube polynomials of Tribonacci cubes ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Alternate Lucas Cubes ⋮ Resonance graphs on perfect matchings of graphs on surfaces ⋮ Structure of Fibonacci cubes: a survey ⋮ Cube polynomial of Fibonacci and Lucas cubes ⋮ Counting vertices and cubes in median graphs of circular split systems ⋮ The structure of $k$-Lucas cubes ⋮ Maximal hypercubes in Fibonacci and Lucas cubes ⋮ Cage-amalgamation graphs, a common generalization of chordal and median graphs ⋮ Daisy cubes and distance cube polynomial ⋮ Pell graphs ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs

This page was built for publication: The cube polynomial and its derivatives: The case of median graphs