The split and non-split tree \((D, C)\)-number of a graph

DOI10.14317/jami.2024.511MaRDI QIDQ6619415

K. R. Santhosh Kumar, A. Sadiquali, P. A. Safeer

Publication date: 15 October 2024

Published in: Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

zbMATH Keywords

chromatic setdominating chromatic setdomination chromatic numbernon-split domination chromatic numbersplit dominating chromatic setsplit domination chromatic numbersplit tree domination chromatic number

Mathematics Subject Classification ID

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

This page was built for publication: The split and non-split tree \((D, C)\)-number of a graph