Results 61 to 70 of about 16,499 (231)
30 pages, 17 figures, 5 tables, 61 ...
Nino Basic +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanmei Hong, Hong-Jian Lai, Qinghai Liu
openaire +1 more source
Frucht’s Theorem for the Digraph Factorial
To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +1 more source
Revisiting the Latin Vocabulary of Terminologia Histologica: II. Adjectives and Participles
ABSTRACT Terminologia Histologica, the international standard nomenclature of human histology and cytology, contains 1093 Latin words that appear to be used as adjectives. Among these, we identified 56 (5%) with a variety of linguistic issues, including typographical or spelling errors, less favored spelling variants, and several unfortunate word ...
Paul E. Neumann +7 more
wiley +1 more source
On kernels by rainbow paths in arc-coloured digraphs
In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no ...
Li Ruijuan, Cao Yanqin, Zhang Xinhong
doaj +1 more source
ABSTRACT Growing concerns about the environmental and social consequences of plastics around the world, manufacturing industries are associated with business are focusing on sustainable end‐of‐life options‐based solutions which aim at increasing the product life cycle.
Sivakumar Kirupanandan +3 more
wiley +1 more source
Embedding b-Metric Spaces of Reducible Fuzzy Digraphs into Normed Spaces
In traditional and iterative algebraic techniques, representing fuzzy digraphs using their adjacency matrices can pose challenges, particularly when dealing with graphs featuring an extensive quantity of nodes or edges.
Umilkeram Qasim Obaid
doaj +1 more source
Extremal skew energy of digraphs with no even cycles [PDF]
Let $D$ be a digraph with skew-adjacency matrix $S(D)$. Then the skew energy of $D$ is defined to be the sum of the norms of all eigenvalues of $S(D)$. Denote by $mathcal{O}_n$ the class of digraphs on order $n$ with no even cycles, and by $mathcal{O ...
Jing Li, Xueliang Li, Huishu Lian
doaj
Rough Neutrosophic Digraphs with Application
A rough neutrosophic set model is a hybrid model which deals with vagueness by using the lower and upper approximation spaces. In this research paper, we apply the concept of rough neutrosophic sets to graphs. We introduce rough neutrosophic digraphs and
Sidra Sayed +3 more
doaj +1 more source
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
We prove that the game-perfect digraphs defined by Andres (2012) with regard to a digraph version of the maker-breaker graph colouring game introduced by Bodlaender (1991) always have a kernel.
Stephan Dominique Andres
doaj +1 more source

