Mappings of Acyclic and Parking Functions.
Maximal buttonings of trees
A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.
Medians and peripherians of trees
Mesures de Gibbs sur les Cantor réguliers
Meta-Fibonacci sequences, binary trees and extremal compact codes.
Méthodes ordinales et combinatoires en analyse des données
Après quelques considérations générales sur les relations entre les mathématiques discrètes, l'informatique et l'analyse des données, ce texte présente un ensemble de méthodes utilisant des techniques ordinales ou (et) combinatoires. A une description succinte de chaque méthode sont jointes quelques références relatives à ses aspects théoriques ainsi qu'à ses implémentations accessibles aux utilisateurs. Pour présenter ces méthodes nous les avons classées suivant la nature des tableaux de données...
Metric dimension and zero forcing number of two families of line graphs
Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the “AIM Minimum Rank–Special Graphs Work Group”, whereas metric dimension is a well-known graph parameter. We investigate the metric dimension and the zero forcing number of some line graphs by first determining the metric dimension and the zero forcing number of the line graphs of wheel graphs and the bouquet of circles. We prove that for a simple and connected graph . Further,...
Metric spaces in pure and applied mathematics.
Minimal 2-dominating sets in trees
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time 𝒪(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
Minimal trees and monophonic convexity
Let V be a finite set and 𝓜 a collection of subsets of V. Then 𝓜 is an alignment of V if and only if 𝓜 is closed under taking intersections and contains both V and the empty set. If 𝓜 is an alignment of V, then the elements of 𝓜 are called convex sets and the pair (V,𝓜 ) is called an alignment or a convexity. If S ⊆ V, then the convex hull of S is the smallest convex set that contains S. Suppose X ∈ ℳ. Then x ∈ X is an extreme point for X if X∖{x} ∈ ℳ. A convex geometry on a finite set is...
Minimum congestion spanning trees of grids and discrete toruses
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.
Minimum functors on categories of Neumann trees
Minimum Steiner Trees in Normed Planes.
Minimum-area drawings of plane 3-trees.
Mixing time for a random walk on rooted trees.
Model-interpretability into trees and applications.
Modified Wiener indices of thorn trees
Monoïde libre et musique : deuxième partie
Monoïde libre et musique, première partie : les musiciens ont-ils besoin des mathématiques ?