A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs

DOI10.1002/jgt.23099zbMATH Open1542.05082MaRDI QIDQ6565816

Yan-Ting Xie, Shou-Jun Xu, Yong-De Feng

Publication date: 2 July 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

median graphsclique polynomialspartial cubescube polynomialscrossing graphs

Mathematics Subject Classification ID

Graph polynomials (05C31)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• A fixed cube theorem for median graphs
• Superextensions and the depth of median graphs
• A canonical decomposition theory for metrics on a finite set
• The structure of median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• A criterion for unimodality
• Clique polynomials and independent set polynomials of graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• The cube polynomial and its derivatives: The case of median graphs
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• Theory of monomer-dimer systems
• Distance-preserving subgraphs of hypercubes
• Chromatic polynomials and logarithmic concavity
• Partial Cubes and Crossing Graphs
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
• Unimodal, log-concave and Pólya frequency sequences in combinatorics
• n‐cubes and median graphs
• A relation between Clar covering polynomial and cube polynomial

This page was built for publication: A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs