Results 111 to 120 of about 16,499 (231)
Infinite kernel perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a ...
Rocío Sánchez-López
doaj +1 more source
Novel Applications of Intuitionistic Fuzzy Digraphs in Decision Support Systems
The Scientific World Journal, 2014 Many problems of practical interest can be modeled and solved by using graph algorithms. In general, graph theory has a wide range of applications in diverse fields.
Muhammad Akram +2 more
doaj +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boland, James +2 more
openaire +3 more sources
Existence of acyclic matching and Morse complex on transitive digraphs
AKCE International Journal of Graphs and CombinatoricsFor any digraph, there exists a transitive closure. The transitive digraph is a discrete geometric object which has a close relationship with simplicial complex.
Chong Wang, Shiquan Ren
doaj +1 more source
Mixed Qualitative/Quantitative Dynamic Simulation of Processing Systems [PDF]
Iranian Journal of Chemistry & Chemical Engineering, 2005 In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the
Shadi Yadegar, Mahmoud Reza Pishvaie
doaj
On Arc Connectivity of Direct-Product Digraphs
Journal of Applied Mathematics, 2012 Four natural orientations of the direct product of two digraphs are introduced in this paper. Sufficient and necessary conditions for these orientations to be strongly connected are presented, as well as an explicit expression of the arc connectivity of ...
Tiedan Zhu, Jianping Ou
doaj +1 more source
Journal of Research of the National Institute of Standards and Technology, 2014 A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. One of the characterizations is new, and allows for a shorter proof of the equivalence of the two known ...
Brian Cloteaux +3 more
openaire +3 more sources
About (k, l)-Kernels, Semikernels and Grundy Functions in Partial Line Digraphs
Discussiones Mathematicae Graph Theory, 2019 Let D be a digraph of minimum in-degree at least 1. We prove that for any two natural numbers k, l such that 1 ≤ l ≤ k, the number of (k, l)-kernels of D is less than or equal to the number of (k, l)-kernels of any partial line digraph ℒD. Moreover, if l
Balbuena C. +2 more
doaj +1 more source
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