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

DOI10.1002/JGT.23099MaRDI QIDQ6565816zbMATH OpenFDO

Authors Yan-Ting Xie, Yong-De Feng, S. J. Xu

Publication date 2 July 2024

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

Full work available at URL https://doi.org/10.1002/JGT.23099

zbMATH Keywords

clique polynomialscrossing graphscube polynomialsmedian graphspartial cubes

Mathematics Subject Classification ID

Graph polynomials (05C31)

Recommendations

• Partial cubes and crossing graphs
• The cube polynomial and its derivatives: The case of median graphs
• Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs
• Induced cycles in crossing graphs of median graphs
• Partial cubes and their \(\tau\)-graphs

Cites work

• n‐cubes and median graphs
• A canonical decomposition theory for metrics on a finite set
• A convexity lemma and expansion procedures for bipartite graphs
• A criterion for unimodality
• A fixed cube theorem for median graphs
• A relation between Clar covering polynomial and cube polynomial
• Chromatic polynomials and logarithmic concavity
• Clique polynomials and independent set polynomials of graphs
• Distance-preserving subgraphs of hypercubes
• Handbook of product graphs
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 15874 (Why is no real title available?)
• scientific article; zbMATH DE number 1339499 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 7427066 (Why is no real title available?)
• Isometric embedding in products of complete graphs
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Nested unimodality
• On the numbers of independent k-sets in a claw free graph
• Partial cubes and crossing graphs
• Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
• Superextensions and the depth of median graphs
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• The cube polynomial and its derivatives: The case of median graphs
• The structure of median graphs
• Theory of monomer-dimer systems
• Unimodal, log-concave and Pólya frequency sequences in combinatorics

Cited in

(3)

• The independence polynomial of trees is not always log-concave starting from order 26
• l₁-embeddability under the edge-gluing operation on some nonbipartite graphs
• Weighted Padovan graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565816)