Semiorders and Riordan numbers.
Semistandard matrices and tableaux. (Matrices et tableaux semi-standard.)
Semisymmetric cubic graphs of order .
Semi-topological classification of line patterns in the plane
Sense Preserving Groups of Polyhedral Graphs.
Sensor Location Problem for a Multigraph
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow...
Separability number and Schurity number of coherent configurations.
Separating plane convex sets.
Sequence enumeration.
Sequenceable groups and related topics.
Sequences of dominating sets.
Sequences of Maximal Degree Vertices in Graphs
2000 Mathematics Subject Classification: 05C35.Let Γ(M ) where M ⊂ V (G) be the set of all vertices of the graph G adjacent to any vertex of M. If v1, . . . , vr is a vertex sequence in G such that Γ(v1, . . . , vr ) = ∅ and vi is a maximal degree vertex in Γ(v1, . . . , vi−1), we prove that e(G) ≤ e(K(p1, . . . , pr)) where K(p1, . . . , pr ) is the complete r-partite graph with pi = |Γ(v1, . . . , vi−1) Γ(vi )|.
Sequences realized as Parker vectors of oligomorphic permutation groups.
Sequences that satisfy .
Sequences with Adjacent Elements Unequal
Sequentially perfect and uniform one-factorizations of the complete graph.
Seriation with applications in philology
Séries de croissance et polynômes d'Ehrhart associés aux réseaux de racines
Étant donnés un système de racines d’une des familles A, B, C, D, F, G et le groupe abélien libre qu’il engendre, on calcule explicitement la série de croissance de ce groupe relativement à Les résultats s’interprètent en termes du polynôme d’Ehrhart de l’enveloppe convexe de .
Series-parallel graphs and well- and better-quasi-orderings
Set colorings in perfect graphs
For a nontrivial connected graph , let be a vertex coloring of where adjacent vertices may be colored the same. For a vertex , the neighborhood color set is the set of colors of the neighbors of . The coloring is called a set coloring if for every pair of adjacent vertices of . The minimum number of colors required of such a coloring is called the set chromatic number . We show that the decision variant of determining is NP-complete in the general case, and show that can be...