Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Eglantine Camby"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 1, Iss Graph Theory (2014)
Graph Theory
Externí odkaz:
https://doaj.org/article/43c8a74d8bbc403f80646458ee7cd151
Autor:
Marco A.R.S. Cruz, Helder R.O. Rocha, Marcia H.M. Paiva, Jair A. Lima Silva, Eglantine Camby, Marcelo E.V. Segatto
Publikováno v:
International Journal of Electrical Power & Energy Systems. 141:108167
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e952491429e04ecf32faf4bec04a7b22
https://doi.org/10.1016/j.ijepes.2022.108167
https://doi.org/10.1016/j.ijepes.2022.108167
Autor:
Eglantine Camby, Marcia Helena Moreira Paiva, Helder Roberto de Oliveira Rocha, Marco António do Rosário Santos Cruz, Marcelo E. V. Segatto, Gilles Caporossi
Publikováno v:
International Journal of Electrical Power and Energy Systems
International Journal of Electrical Power and Energy Systems, Elsevier, 2019, 106, pp.96-104. ⟨10.1016/j.ijepes.2018.09.020⟩
International Journal of Electrical Power & Energy Systems
International Journal of Electrical Power & Energy Systems, 2019, 106, pp.96-104. ⟨10.1016/j.ijepes.2018.09.020⟩
International Journal of Electrical Power and Energy Systems, Elsevier, 2019, 106, pp.96-104. ⟨10.1016/j.ijepes.2018.09.020⟩
International Journal of Electrical Power & Energy Systems
International Journal of Electrical Power & Energy Systems, 2019, 106, pp.96-104. ⟨10.1016/j.ijepes.2018.09.020⟩
International audience; Power system state estimation relies increasingly on PMU measurements to ef-fectively control and monitor growing and stressed transmission networks whichare also affected by transient and dynamic events. High PMU cost has mot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b911ea2718fd7f326b681ab64878ffe
https://doi.org/10.1016/j.ijepes.2018.09.020
https://doi.org/10.1016/j.ijepes.2018.09.020
Autor:
Eglantine Camby
Publikováno v:
Graphs and Combinatorics. 35:103-118
The vertex cover problem and the dominating set problem are two well-known problems in graph theory. Their goal is to find the minimum size of a vertex subset satisfying some properties. Both hold a connected version, which imposes that the vertex su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3539109f8184d55ade7c847d8d97a7c
https://doi.org/10.1007/s00373-018-1981-x
https://doi.org/10.1007/s00373-018-1981-x
Autor:
Marco Cruz, Helder R. O. Rocha, Marcia H. M. Paiva H. M. Paiva, Jair A. Lima Silva A. Lima Silva, Eglantine Camby, Marcelo E. V. Segatto
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3680ce48e2ca696e810f438831da4a0
https://doi.org/10.2139/ssrn.3983786
https://doi.org/10.2139/ssrn.3983786
Publikováno v:
Discrete Applied Mathematics. 234:3-11
Two vertex colorings of a graph G are equivalent if they induce the same partition of the vertex set into color classes. The graphical Bell number B ( G ) is the number of non-equivalent vertex colorings of G . We determine a sharp lower bound on B (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc6b68136d9607f0a35e20c10445bf04
https://doi.org/10.1016/j.dam.2016.06.025
https://doi.org/10.1016/j.dam.2016.06.025
Autor:
Fränk Plein, Eglantine Camby
Publikováno v:
Discrete Applied Mathematics. 217:711-717
Let γ ( G ) and ź ( G ) be the domination and independent domination numbers of a graph G , respectively. Introduced by Sumner and Moore (1979), a graph G is domination perfect if γ ( H ) = ź ( H ) for every induced subgraph H ź G . In 1991, Zve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a721044bb4cfcda43472fbd06c4b1bf
https://doi.org/10.1016/j.dam.2016.09.040
https://doi.org/10.1016/j.dam.2016.09.040
Autor:
Oliver Schaudt, Eglantine Camby
Publikováno v:
Algorithmica. 75:205-217
Let $$G$$G be a connected $$P_k$$Pk-free graph, $$k \ge 4$$k?4. We show that $$G$$G admits a connected dominating set that induces either a $$P_{k-2}$$Pk-2-free graph or a graph isomorphic to $$P_{k-2}$$Pk-2. In fact, every minimum connected dominati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0abfbf891c5998dd90473715af5779ef
https://doi.org/10.1007/s00453-015-9989-6
https://doi.org/10.1007/s00453-015-9989-6
Autor:
Eglantine Camby, Oliver Schaudt
Publikováno v:
Discrete Applied Mathematics. 177:53-59
In the first part of this paper, we investigate the interdependence of the connected domination number γ c ( G ) and the domination number γ ( G ) in some hereditary graph classes. We prove the following results: • A connected graph G is ( P 6 ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d598283171bcf06fccbd4c14cb62e3a
https://doi.org/10.1016/j.dam.2014.05.029
https://doi.org/10.1016/j.dam.2014.05.029