• Aucun résultat trouvé

Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex

N/A
N/A
Protected

Academic year: 2021

Partager "Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex"

Copied!
35
0
0

Texte intégral

Loading

Figure

Figure 1: Graph G in Proposition 9, for r = 6 and k = 4. Squares and circles, white or black, small or large, are vertices
Figure 2: Graph G in Proposition 11, for r = 5 and k = 6. Squares and circles, white or black, small or large, are vertices
Figure 3: The graphs G x and G in Proposition 13.
Figure 4: A partial representation of the graph G in Proposition 15: more edges exist between the vertices x i (1) and y i (1) on the one hand, and the vertices a j (1) on the other hand
+7

Références

Documents relatifs

We have planned four days of scientific presentations and debates organized as oral and poster communications which will center around 5 major topics: Food and nutrient

L’ATP mitochondrial, grâce au couplage fonctionnel entre la MtCK et l’ANT et à la restriction de la diffusion au niveau de la membrane mitochondriale externe, pourraient, de

This is also supported by our estimated proportion of chronic pain sufferers with neuropathic characteristics in the general population (25 of sufferers of chronic pain of at

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of

En effet, Selon notre connaissance dans la ville Mostaganem, nous avons constaté globalement l’absence d’un Système d’Information Géographique et d’un processus

kernel function, number of neighbors L in the adjacency matrix, number of wavelet scales S, wavelet coefficients used in feature extraction for a given scale s (we are using only

This chapter examines the establishment of Sapporo Agricultural College on Hokkaido Island and its connection to the development of the commercial nursery system through

We show that the decision versions of the minimum cover and partition by γ-quasi-cliques problems are NP-complete for any fixed γ satisfying 0 < γ < 1.. Key-words: