Results 121 to 130 of about 8,697 (224)
Algebra universalisAbstract Call a finite relational structure k-Słupecki if its only surjective k -ary polymorphisms are essentially unary, and Słupecki if it is k -Słupecki
Kunos, Ádám +2 more
openaire +2 more sources
Rational construction method for linearly extended structures based on alterative options [PDF]
Инженерно-строительный журнал, 2012 In the development of construction technology of linearly extended structures at the stage work production plan the possibility to reduce the construction time and improving organizational and technological reliability, represented by the presence of ...
G.I. Abdullaev
doaj
Signed Total Roman Domination in Digraphs
Discussiones Mathematicae Graph Theory, 2017 Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz
doaj +1 more source
, 2000 A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre-specified digraphs. Well-known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers.
Sven Hartmann
core
Color digraph dan Cayley color digraph dari grup siklik Zn dengan n bilangan prima [PDF]
, 2009 Misal (G,o) adalah grup, (G,o) dikatakan grup siklik jika dan hanya jika terdapat a ∈ G yang sedemikian hingga setiap elemen dari G dapat dibangkitkan/dibangun oleh a, dengan kata lain setiap elemen dari G dapat dituliskan sebagai perpangkatan dari a ...
Jalil, Abdul
core
Finite-dimensional flexible algebras associated with directed and weighted CW complexes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaIn this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj +1 more source
Directed graph theory for the analysis of biological regulatory networks
Frontiers in Applied Mathematics and StatisticsSynchronous regulated biological networks are often represented as logical diagrams, where the precise interactions between elements remain obscured. Here, we introduce a novel type of excitation-inhibition graph based on Boolean logic, which we term ...
Martha Takane +8 more
doaj +1 more source
Discrete Mathematics, 2012 We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to directed graphs, while the second characterization says a digraph is split if and only if its degree sequence satisfies ...
openaire +3 more sources
Exact and Approximate Digraph Bandwidth
International audienceIn this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately.
Jain, Pallavi +4 more
core +1 more source
Journal of Combinatorial Mathematics and Combinatorial ComputingA ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph.
openaire +2 more sources