المؤلفون: Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen

المصدر: Mathematical and Computational Applications, Vol 29, Iss 3, p 32 (2024)

مصطلحات موضوعية: graph, zero forcing set, k-forcing, automata, network, Applied mathematics. Quantitative methods, T57-57.97, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

العلاقة: https://www.mdpi.com/2297-8747/29/3/32Test; https://doaj.org/toc/1300-686XTest; https://doaj.org/toc/2297-8747Test

الوصول الحر: https://doaj.org/article/7f838eaaa5794374814a1d8e7f382582Test

المؤلفون: Raksha M. R., Dominic Charles

المصدر: Acta Universitatis Sapientiae: Informatica, Vol 14, Iss 1, Pp 137-154 (2022)

مصطلحات موضوعية: zero forcing number, zero forcing set, closed global shadow graph, open global shadow graph, 05c07, 05c38, 05c50, 05c69, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

العلاقة: https://doaj.org/toc/2066-7760Test

الوصول الحر: https://doaj.org/article/b43391ecd925451593746ffb673c484bTest

المؤلفون: Malur, Raksha, Dominic, Charles

المصدر: Proyecciones (Antofagasta, On line); Vol. 42 No. 1 (2023); 33-52 ; Proyecciones. Revista de Matemática; Vol. 42 Núm. 1 (2023); 33-52 ; 0717-6279 ; 10.22199/issn.0717-6279-2023-01

مصطلحات موضوعية: zero forcing set, zero forcing number, open global shadow graph, 05C07, 05C38, 05C50, 05C69

وصف الملف: application/pdf

العلاقة: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5305/4229Test; https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5305Test

الإتاحة: https://doi.org/10.22199/issn.0717-6279-5305Test
https://doi.org/10.22199/issn.0717-6279-2023-01Test
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5305Test

المؤلفون: Davila Randy, Henning Michael A.

المصدر: Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 733-754 (2020)

مصطلحات موضوعية: forcing set, forcing number, total forcing set, total forcing number, 05c69, Mathematics, QA1-939

وصف الملف: electronic resource

العلاقة: https://doaj.org/toc/2083-5892Test

الوصول الحر: https://doaj.org/article/68b6aec13c7e4c08ac834e26eb7beec0Test

المؤلفون: Yongsheng Rao, Saeed Kosari, Janakiraman Anitha, Indra Rajasingh, Hossein Rashmanlou

المصدر: Mathematics; Volume 10; Issue 8; Pages: 1263

مصطلحات موضوعية: dominating set, power dominating set, zero forcing set, electrical power network, fully connected cubic networks

وصف الملف: application/pdf

العلاقة: https://dx.doi.org/10.3390/math10081263Test

الإتاحة: https://doi.org/10.3390/math10081263Test

المؤلفون: Layia Aliahmadipour, Saeedeh Rashidi

المصدر: Journal of Mahani Mathematical Research, Vol 8, Iss 1, Pp 23-35 (2019)

مصطلحات موضوعية: zero forcing set, fuzzy graph, fuzzy zero forcing set, Mathematics, QA1-939

وصف الملف: electronic resource

العلاقة: https://jmmrc.uk.ac.ir/article_2450_b53ca4f069c67d25e909c5dec53a921f.pdfTest; https://doaj.org/toc/2251-7952Test; https://doaj.org/toc/2645-4505Test

الوصول الحر: https://doaj.org/article/ace7e5fb9991450e9c17ece5101e8b71Test

المؤلفون: Dorbec, Paul

المساهمون: Equipe AMACC - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)

المصدر: Topics in Domination in Graphs ; https://hal.science/hal-03073783Test ; Topics in Domination in Graphs, 2020, 978-3-030-51117-3. ⟨10.1007/978-3-030-51117-3_16⟩

مصطلحات موضوعية: power domination, zero forcing set, propagation, phasor measurement unit placement, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

العلاقة: hal-03073783; https://hal.science/hal-03073783Test; https://hal.science/hal-03073783/documentTest; https://hal.science/hal-03073783/file/power-domination-FINAL.pdfTest

الإتاحة: https://doi.org/10.1007/978-3-030-51117-3_16Test
https://hal.science/hal-03073783Test
https://hal.science/hal-03073783/documentTest
https://hal.science/hal-03073783/file/power-domination-FINAL.pdfTest

المؤلفون: 大内, 康治

مصطلحات موضوعية: computational origami, flat foldability, forcing set, enumeration

وصف الملف: application/pdf

الوصول الحر: https://ndlsearch.ndl.go.jp/books/R100000039-I11512308Test

Degree: 博士（情報科学） -- 北陸先端科学技術大学院大学

المؤلفون: Cazals, Pierre, Darties, Benoit, Chateau, Annie, Giroudeau, Rodolphe, Weller, Mathias

المساهمون: Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Methods, Algorithms for Operations REsearch (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), Méthodes et Algorithmes pour la Bioinformatique (MAB), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)

المصدر: IWOCA 2019 - 30th International Workshop on Combinatorial Algorithms ; https://hal.science/hal-02359076Test ; IWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩ ; http://iwoca2019.di.unipi.itTest/

مصطلحات موضوعية: Synchrophasor, Power Edge Set, Zero Forcing Set, Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

جغرافية الموضوع: Pisa, Italy

العلاقة: hal-02359076; https://hal.science/hal-02359076Test; https://hal.science/hal-02359076/documentTest; https://hal.science/hal-02359076/file/main.pdfTest

الإتاحة: https://doi.org/10.1007/978-3-030-25005-8_11Test
https://hal.science/hal-02359076Test
https://hal.science/hal-02359076/documentTest
https://hal.science/hal-02359076/file/main.pdfTest

المؤلفون: Anitha, J., Rajasingh, Indra

المصدر: Proyecciones (Antofagasta, On line); Vol. 38 No. 5 (2019); 999-1010 ; Proyecciones. Revista de Matemática; Vol. 38 Núm. 5 (2019); 999-1010 ; 0717-6279

مصطلحات موضوعية: Zero forcing set, Pyrene networks, Circum-pyrene networks, Circum-trizene networks, 05C69, Dominating sets, independent sets, cliques, 05C85, Graph algorithms, 05C90, Applications, 05C20, Directed graphs (digraphs), tournaments

وصف الملف: application/pdf

العلاقة: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3907/3306Test; https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3907Test

الإتاحة: https://doi.org/10.22199/issn.0717-6279-2019-05-0064Test
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3907Test