Dominated coloring in certain networks

No abstract is available for this paper.

• Publication year

  2024

• Venue

  Soft Computing - A Fusion of Foundations, Methodologies and Applications

• Publication date

  2024-01-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00500-023-09568-w
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Independent domination polynomial of zero-divisor graphs of commutative rings

  2022cited by this paper
• Dominator and total dominator coloring of circulant graph Cn (1, 2)

  2021cited by this paper
• On the Sum of Degree-Based Topological Indices of Rhombus-Type Silicate and Oxide Structures

  2021cited by this paper
• Dominated and dominator colorings over (edge) corona and hierarchical products

  2020cited by this paper
• Total chromatic number for some classes of Cayley graphs

  2020cited by this paper
• Every Planar Map Is Four Colorable

  2019cited by this paper
• On dominated coloring of graphs and some Nordhaus–Gaddum-type relations

  2018cited by this paper
• A survey and classification of Sierpiński-type graphs

  2017cited by this paper
• Uncertain vertex coloring problem

  2017cited by this paper
• COMPUTATION OF SOME TOPOLOGICAL INDICES OF CERTAIN NETWORKS

  2017cited by this paper
• Further results on computation of topological indices of certain networks

  2017cited by this paper
• Vertex cut method for degree and distance-based topological indices and its applications to silicate networks

  2016cited by this paper
• Dominated Colorings of Graphs

  2015cited by this paper
• The Linear t-Colorings of Sierpiński-Like Graphs

  2014cited by this paper
• On dominating sets of maximal outerplanar graphs

  2013cited by this paper
• On the dominator colorings in trees

  2012cited by this paper
• Coloring Hanoi and Sierpiński graphs

  2012cited by this paper
• Algorithmic Aspects of Dominator Colorings in Graphs

  2011cited by this paper
• On the distance paired-domination of circulant graphs.

  2011cited by this paper
• A survey on vertex coloring problems

  2010cited by this paper
• Topological properties of silicate networks

  2009cited by this paper
• Dominating sets in plane triangulations

  2008cited by this paper
• Efficient domination in circulant graphs with two chord lengths

  2007cited by this paper
• A survey on multi-loop networks

  2003cited by this paper
• Publisher's Note

  2003cited by this paper
• 1-perfect codes in Sierpiński graphs

  2002cited by this paper
• Topological Structure and Analysis of Interconnection Networks

  2002influential reference
• Domination in graphs : advanced topics

  1998cited by this paper
• Fundamentals of domination in graphs

  1998cited by this paper
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

  1997cited by this paper
• The Four-Colour Theorem

  1997cited by this paper
• Domination numbers of planar graphs

  1996cited by this paper
• EVERY PLANAR MAP IS FOUR COLORABLE

  1991cited by this paper

• Geodesic Dominated Coloring of Graphs

  2025cites this paper
• Dominated coloring in certain trees

  2025cites this paper
• The Dominated Chromatic Number of Certain Ladder Graph

  2025cites this paper