Some parameters of graph and its complement

DOI10.1016/0012-365X(87)90142-7MaRDI QIDQ1094434zbMATH OpenFDO

Authors Shaoji Xu

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(87)90142-7

zbMATH Keywords

circumferencediameteredge coveringgirthinequalitiesNordhaus-Gaddum type

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

The paper presents inequalities of the Nordhaus-Gaddum type for the diameter d, girth g, circumference c, and edge covering number \(\beta_ 1\) of a graph G.

Cites work

• Complementary Graphs and Edge Chromatic Numbers
• Graph theory
• scientific article; zbMATH DE number 3733944 (Why is no real title available?)
• scientific article; zbMATH DE number 3432294 (Why is no real title available?)
• scientific article; zbMATH DE number 3334007 (Why is no real title available?)
• scientific article; zbMATH DE number 3338394 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• Multicoloring the incidentors of a weighted directed multigraph
• On Complementary Graphs
• Parallel concepts in graph theory
• Some Theorems on Abstract Graphs

Cited in

(9)

• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• Some defective parameters in graphs
• scientific article; zbMATH DE number 90552 (Why is no real title available?)
• scientific article; zbMATH DE number 519999 (Why is no real title available?)
• A study on distance in graph complement
• A polynomial time algorithm for geodetic hull number for complementary prisms
• On dominated coloring of graphs and some Nordhaus-Gaddum-type relations
• Relations between parameters of a graph
• Nordhaus-Gaddum relations for proximity and remoteness in graphs

This page was built for publication: Some parameters of graph and its complement

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