97 citations
- Centre National de la Recherche ScientifiqueFR46 papers
- Lyon 1 UniversitéFR23 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR17 papers
- Georges Friedel LaboratoryFR16 papers
- InsermFR16 papers
- Université Clermont AuvergneFR13 papers
- Centrale Lyon ENISEFR9 papers
- Université Jean MonnetFR8 papers
- University of Clermont Auvergne8 papers
- Biologie, ingénierie et imagerie pour l'OphtalmologieFR6 papers
- University of TurkuFI6 papers
- Centre Hospitalier Universitaire de Saint-ÉtienneFR4 papers
10 papers · 1 filter
Explicit M-Polynomial and Degree-Based Topological Indices of Generalized Hanoi Graphs
El-Mehdi Mehiri
The M-polynomial, introduced by Deutsch and Klavžar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Za…
Locating-dominating partitions for some classes of graphs
Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul +1
A dominating set of a graph is a set such that every vertex in is adjacent to at least one vertex in . A set is a loc…
Identifying codes in graphs of given maximum degree: Characterizing trees
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a dominating set of vertices of such that any two vertices in have a distinct intersection between their closed n…
Algorithms and hardness for Metric Dimension on digraphs
Antoine Dailly, Florent Foucaud, Anni Hakanen
In the Metric Dimension problem, one asks for a minimum-size set of vertices such that for any pair of vertices of the graph, there is a vertex from whose two distances to…
Extremal digraphs for open neighbourhood location-domination and identifying codes
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
A set of vertices of a digraph is called an open neighbourhood locating-dominating set if every vertex in has an in-neighbour in , and for every pair of vertic…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…