A result on the optimal binding function of odd signable graphs

DOI10.1360/SSM-2020-0036MaRDI QIDQ5064234zbMATH OpenFDO

Authors Rong Wu, Baogang Xu

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/SSM-2020-0036

zbMATH Keywords

chromatic numberclique numbereven hole

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• An upper bound on the largest signless Laplacian of an odd unicyclic graph
• scientific article; zbMATH DE number 1109397
• scientific article; zbMATH DE number 4035879
• scientific article; zbMATH DE number 165528
• scientific article; zbMATH DE number 1135805
• Publication:4726285
• On the study of total signed domination function of graphs
• New bounds on the signed domination numbers of graphs
• New bounds on the signed total domination number of graphs
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank

Cited in

(4)

• A better upper bound on the chromatic number of (cap, even-hole)-free graphs
• Bounding Functions and Rigid Graphs
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• On the chromatic number of a family of odd hole free graphs

This page was built for publication: A result on the optimal binding function of odd signable graphs

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