Results 31 to 40 of about 8,914 (221)
Operations Research and Decisions, 2016 OPERATIONS RESEARCH AND DECISIONS; ISSN 2081 ...
Peters, Hans +2 more
openaire +8 more sources
Smarandachely antipodal signed digraphs [PDF]
, 2010 For standard terminology and notion in digraph theory, we refer the reader to the classic text-books of Bondy and Murty [1] and Harary et al.[3]; the non-standard will be given in this paper as and when ...
Salestina, M. Ruby +5 more
core +1 more source
Journal of Combinatorial Theory, Series B, 2017 An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that it is NP-complete to decide whether two vertices $x,y$ in a digraph are connected by an antidirected path, while one can decide
Jørgen Bang-Jensen +3 more
openaire +4 more sources
Path homologies of motifs and temporal network representations
Applied Network Science, 2022 Path homology is a powerful method for attaching algebraic invariants to digraphs. While there have been growing theoretical developments on the algebro-topological framework surrounding path homology, bona fide applications to the study of complex ...
Samir Chowdhury +2 more
doaj +1 more source
A line digraph of a complete bipartite digraph
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Liu 0001, Lin Sun, Jixiang Meng
openaire +1 more source
On arc-coloring of digraphs [PDF]
Opuscula Mathematica, 2006 In the paper we deal with the problem of the arc-colouring of some classes of digraphs (tournaments, complete digraphs and products of digraphs).
Małgorzata Zwonek
doaj
On Decomposing the Complete Symmetric Digraph into Orientations of K4 − e
Discussiones Mathematicae Graph Theory, 2019 Let D be any of the 10 digraphs obtained by orienting the edges of K4 − e. We establish necessary and sufficient conditions for the existence of a (Kn*$K_n^*$, D)-design for 8 of these digraphs.
Bunge Ryan C. +7 more
doaj +1 more source
Decision-Making Approach Based on Neutrosophic Rough Information
Algorithms, 2018 Rough set theory and neutrosophic set theory are mathematical models to deal with incomplete and vague information. These two theories can be combined into a framework for modeling and processing incomplete information in information systems.
Muhammad Akram +3 more
doaj +1 more source
Processing Large Outliers in Arrays of Observations
Mathematics, 2022 The interest in large or extreme outliers in arrays of empirical information is caused by the wishes of users (with whom the author worked): specialists in medical and zoo geography, mining, the application of meteorology in fishing tasks, etc.
Gurami Tsitsiashvili
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1981 AbstractLet G be a directed graph on n vertices (single loops allowed) such that there are λ directed paths of length k from P to Q for any distinct pair of vertices (P, Q). We prove that if n > 2 and k > 2, G is regular. The regular case is also discussed.
William G. Bridges, R. A. Mena
openaire +3 more sources