Minimum maximal graphs with forbidden subgraphs
Minimum rank of a tree over an arbitrary field.
Minimum rank of edge subdivisions of graphs.
Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers.
Minimum semidefinite rank of outerplanar graphs and the tree cover number.
Minimum Steiner Trees in Normed Planes.
Minimum sum and difference covers of abelian groups.
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation algorithm...
Minimum-area drawings of plane 3-trees.
Minmax strongly connected subgraphs with node penalties.
Minus total domination in graphs
A three-valued function defined on the vertices of a graph is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every , , where consists of every vertex adjacent to . The weight of an MTDF is , over all vertices . The minus total domination number of a graph , denoted , equals the minimum weight of an MTDF of . In this paper, we discuss some properties of minus total domination on a graph and obtain...
Minuscule heaps over Dynkin diagrams of type .
Mixed sums of squares and triangular numbers
Mixing time for a random walk on rooted trees.
Mnëv's universality theorem revisited.
Mock modular forms and singular combinatorial series
A celebrated result of Bringmann and Ono shows that the combinatorial rank generating function exhibits automorphic properties after being completed by the addition of a non-holomorphic integral. Since then, automorphic properties of various related combinatorial families have been studied. Here, extending work of Andrews and Bringmann, we study general infinite families of combinatorial q-series pertaining to k-marked Durfee symbols, in which we allow additional singularities. We show that these...
Modèles d'optimisation en analyse des données relationnelles
Model-interpretability into trees and applications.
Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices.
Moderní pohled na „jistý problém minimální‟