Computation of certain domination numbers of collaboration graphs

DOI10.1007/S41478-024-00723-6MaRDI QIDQ6988905zbMATH OpenFDO

Authors M. S. Anitha, Yegnanarayanan Venkatraman

Publication date 30 April 2025

Published in The Journal of Analysis (Search for Journal in Brave)

zbMATH Keywords

acyclic chromatic numbercollaboration graphweak domination numberstrong domination number\(k\)-distance chromatic numberweak dominating setstrong dominating setErdős numberRolf Nevanlinna prize

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Computation of certain domination numbers of collaboration graphs

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