Some properties of the closed global shadow graphs and their zero forcing number
Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the zero forcing number of the graph is defined a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2022-08-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausi-2022-0009 |
| _version_ | 1811186002299977728 |
|---|---|
| author | Raksha M. R. Dominic Charles |
| author_facet | Raksha M. R. Dominic Charles |
| author_sort | Raksha M. R. |
| collection | DOAJ |
| description | Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the zero forcing number of the graph is defined as closed global shadow graph. Basic properties and zero forcing number of this graph class is analysed. |
| first_indexed | 2024-04-11T13:39:06Z |
| format | Article |
| id | doaj.art-b43391ecd925451593746ffb673c484b |
| institution | Directory Open Access Journal |
| issn | 2066-7760 |
| language | English |
| last_indexed | 2024-04-11T13:39:06Z |
| publishDate | 2022-08-01 |
| publisher | Sciendo |
| record_format | Article |
| series | Acta Universitatis Sapientiae: Informatica |
| spelling | doaj.art-b43391ecd925451593746ffb673c484b2022-12-22T04:21:21ZengSciendoActa Universitatis Sapientiae: Informatica2066-77602022-08-0114113715410.2478/ausi-2022-0009Some properties of the closed global shadow graphs and their zero forcing numberRaksha M. R.0Dominic Charles1Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, India.Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, India.Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the zero forcing number of the graph is defined as closed global shadow graph. Basic properties and zero forcing number of this graph class is analysed.https://doi.org/10.2478/ausi-2022-0009zero forcing numberzero forcing setclosed global shadow graphopen global shadow graph05c0705c3805c5005c69 |
| spellingShingle | Raksha M. R. Dominic Charles Some properties of the closed global shadow graphs and their zero forcing number Acta Universitatis Sapientiae: Informatica zero forcing number zero forcing set closed global shadow graph open global shadow graph 05c07 05c38 05c50 05c69 |
| title | Some properties of the closed global shadow graphs and their zero forcing number |
| title_full | Some properties of the closed global shadow graphs and their zero forcing number |
| title_fullStr | Some properties of the closed global shadow graphs and their zero forcing number |
| title_full_unstemmed | Some properties of the closed global shadow graphs and their zero forcing number |
| title_short | Some properties of the closed global shadow graphs and their zero forcing number |
| title_sort | some properties of the closed global shadow graphs and their zero forcing number |
| topic | zero forcing number zero forcing set closed global shadow graph open global shadow graph 05c07 05c38 05c50 05c69 |
| url | https://doi.org/10.2478/ausi-2022-0009 |
| work_keys_str_mv | AT rakshamr somepropertiesoftheclosedglobalshadowgraphsandtheirzeroforcingnumber AT dominiccharles somepropertiesoftheclosedglobalshadowgraphsandtheirzeroforcingnumber |