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)

Full work available at URL https://doi.org/10.1007/S41478-024-00723-6

zbMATH Keywords

\(k\)-distance chromatic numberacyclic chromatic numbercollaboration graphErdős numberRolf Nevanlinna prizestrong dominating setstrong domination numberweak dominating setweak domination number

Mathematics Subject Classification ID

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

Cites work

• A graph‐theoretic generalization of the clique concept
• A note on the importance of collaboration graphs
• A Random Graph Model for Power Law Graphs
• Acyclic colorings of planar graphs
• Acyclic Colourings of Planar Graphs with Large Girth
• Algorithm 457: finding all cliques of an undirected graph
• And What Is Your Erdos Number?
• Collective dynamics of `small-world' networks
• Complex networks: structure and dynamics
• Good and semi-strong colorings of oriented planar graphs
• Graph models for social relations
• Graph theory for complex networks. I
• scientific article; zbMATH DE number 6096685 (Why is no real title available?)
• scientific article; zbMATH DE number 1185322 (Why is no real title available?)
• scientific article; zbMATH DE number 3720969 (Why is no real title available?)
• scientific article; zbMATH DE number 3616457 (Why is no real title available?)
• scientific article; zbMATH DE number 1249703 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Mathematical Reviews. Sponsored by the American Mathematical Society, the Mathematical Association of America.
• On acyclic colorings of planar graphs
• On strong domination number of graphs
• On the Fundamental Problem of Mathematics
• Star arboricity of graphs
• Statistical mechanics of complex networks
• The k-distance chromatic number of trees and cycles
• The asymptotic number of labeled graphs with given degree sequences
• The Chromatic Number of Graph Powers
• The chromatic number of oriented graphs

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)