Results 81 to 90 of about 121,460 (194)
AN EQUILIBRIUM SITUATION IN A PATROLLING GAME WITH A TRACKING CAMERA
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015 Equilibrium situations in a problem of patrolling on a graph were obtained using game theory methods. The solution of the game was found for a graph modeling the flux of information from data source to sink.
Vasily Gusev
doaj +1 more source
A short note on undirected Fitch graphs
The Art of Discrete and Applied Mathematics, 2018 The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
Geiß, M. +3 more
openaire +5 more sources
Characterization of Graphs Associated with the Ideal of Numerical Semigroups
Journal of Mathematics, 2020 Let I be an ideal of a numerical semigroup Λ. We define an undirected graph GIΛ with vertex set vi:i∈Λ∖I∗=Λ∖I−0 and edge set vivj⟺i+j∈I. The aim of this article is to discuss the connectedness, girth, completeness, and some other related properties of ...
Peng Xu +5 more
doaj +1 more source
On network deconvolution for undirected graphs
BiometricsABSTRACT Network deconvolution (ND) is a method to reconstruct a direct-effect network describing direct (or conditional) effects (or associations) between any two nodes from a given network depicting total (or marginal) effects (or associations). Its key idea is that, in a directed graph, a total effect can be decomposed into the sum of
Zhaotong Lin, Isaac Pan, Wei Pan
openaire +2 more sources
Packing Coloring of Undirected and Oriented Generalized Theta Graphs
, 2016 The packing chromatic number $\chi$ $\rho$ (G) of an undirected (resp. oriented) graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1,..., V k, in such a way that every two distinct vertices
Bouchemakh, Isma +2 more
core +1 more source
Bitopological spaces on undirected graphs
Journal of Mathematics and Computer Science, 2018 Summary: The aim of this article is to associate a bitopological space with every locally finite graph \(G\) (a graph in which every vertex is adjacent with finite number of edges). Then, some properties of this bitopological space were investigated. After that, connectedness and dense subsets were discussed.
Abdu, Khalid Abdulkalek, Kilicman, Adem
openaire +2 more sources
On diameters estimations of the commuting graphs of Sylow $p$-subgroups of the symmetric groups
Karpatsʹkì Matematičnì Publìkacìï, 2013 The commuting graph of a group $G$ is an undirected graph whose vertices are non-central elements of $G$ and two distinct vertices $x,y$ are adjacent if and only if $xy=yx$.
Yu.Yu. Leshchenko, L.V. Zoria
doaj +1 more source
Graphs from matrices - a survey
AKCE International Journal of Graphs and CombinatoricsLet R be a commutative ring with identity. For a positive integer [Formula: see text] let [Formula: see text] be the set of all n × n matrices over R and [Formula: see text] be the set of all non-zero matrices of [Formula: see text] The zero-divisor ...
T. Tamizh Chelvam
doaj +1 more source
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
, 2010 The oriented chromatic number of an oriented graph $\vec G$ is the minimum order of an oriented graph $\vev H$ such that $\vec G$ admits a homomorphism to $\vev H$.
Sopena, Eric
core +1 more source
Measuring associativity: graph algebras of undirected graphs
Algebra universalisAbstractWe study two measures of associativity for graph algebras of finite undirected graphs: the index of nonassociativity and (a variant of) the semigroup distance. We determine “almost associative” and “antiassociative” graphs with respect to both measures.
Kátai-Urbán Kamilla, Waldhauser Tamás
openaire +1 more source