Search results for: CORONA GRAPH

• Discussiones Mathematicae Graph Theory

  Journals

  ISSN: 1234-3099 , eISSN: 2083-5892

• Coronas and Domination Subdivision Number of a Graph

  Publication

  • M. Dettlaff
  • M. Lemańska
  • J. Topp
  • P. Żyliński

  - Bulletin of the Malaysian Mathematical Sciences Society - Year 2018

  In this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.

  Full text available to download

• Equitable coloring of corona products of graphs

  Publication

  • H. Furmańczyk
  • K. Kaliraj
  • M. Kubale
  • J. Vernold Vivin

  - Advances and Applications in Discrete Mathematics - Year 2013

  In this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.

  Full text available to download

• On the metric dimension of corona product graphs

  Publication

  • I. G. Yero
  • D. Kuziak
  • J. A. RODRíGUEZ-VELáZQUEZ

  - COMPUTERS & CHEMICAL ENGINEERING - Year 2011

  We give several results on the metric dimension of corona product graphs.

  Full text to download in external service

• Equitable coloring of corona multiproducts of graphs

  Publication

  • H. Furmańczyk
  • M. Kubale
  • V. Mkrtchyan

  - Discussiones Mathematicae Graph Theory - Year 2017

  We give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.

  Full text available to download

• Equitable colorings of some variation of corona products of cubic graphs

  Publication

  • M. Kubale
  • H. Furmańczyk

  - Archives of Control Sciences - Year 2024

  The problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.

  Full text available to download

• Ochrona przed Korozją

  Journals

  ISSN: 0473-7733 , eISSN: 2449-9501

• OCHRONA ŚRODOWISKA

  Journals

  ISSN: 1230-6169

• Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.

  Publication

  • H. Furmańczyk
  • A. Kosowski
  • P. Żyliński

  - Year 2008

  W pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.

  Full text to download in external service

• GRAPHS AND COMBINATORICS

  Journals

  ISSN: 0911-0119 , eISSN: 1435-5914