Results 11 to 20 of about 9,505,081 (140)

Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators

open access: yesJournal of Advanced Transportation, 2021
Software tools using computer simulations are frequently used in the research and optimization of railway transport systems. Such simulations serve to examine different railway traffic scenarios (which typically reflect different timetables and railway ...
Antonin Kavička, Pavel Krýže
doaj   +1 more source

Dr. Lee Chia Kuang invents new software Dematel Digraph [PDF]

open access: yes, 2021
A lecturer from the Faculty of Industrial Management (FPI), Universiti Malaysia Pahang (UMP), Dr.
Safriza, Baharuddin   +1 more
core   +1 more source

Dr. Lee Chia Kuang cipta perisian baharu Dematel Digraph [PDF]

open access: yes, 2021
Penyelidik dari Fakulti Pengurusan Industri (FPI), Universiti Malaysia Pahang (UMP), Dr.
Safriza, Baharuddin   +1 more
core   +1 more source

ISOMORFISMA DIGRAPH EKSENTRIS DENGAN DIGRAPH ASALNYA [PDF]

open access: yes, 2005
Digraph sikel Cn adalah digraph yang paling sederhana yang digraph eksentrisnya isomorfis dengan digraph asalnya. Sedangkan digraph lengkap Kn adalah digraph komplit yang digraph eksentrisnya isomorfis bahkan sama dengan digraph asalnya, sehingga untuk ...
IDA RIYAWATI, 0800112306
core   +1 more source

DIGRAPH GROUPS AND RELATED GROUPS [PDF]

open access: yes, 2022
This thesis investigates finite digraph groups and related groups like the generalization of Johnson and Mennicke groups. Cuno and Williams introduced the term "digraph group" for the first time in [9], 2020.
Cihan, Mehmet Sefa
core   +1 more source

Neutrosophic Digraph with Generalized Modus Tollens

open access: yes, 2022
In this paper, we generalize modus tollens method for neutrosophic digraph by using neutrosophic ruleand define degree of a vertex in neutrosophic digraph, Indegree of a vertex in neutrosophic digraph, out degree ofa vertex in neutrosophic digraph and ...
Elsayed Badr, Shokry Nada, Ashraf ELrokh, Hoda Mostafa
core   +1 more source

Digraph Groups Without Leaf Having An Arc Count One Greater Than Their Vertex

open access: yesCumhuriyet Science Journal
This paper investigates a particular class of digraph groups that are defined by non-empty balanced presentations. Each relation is expressed in the form R(x,y), where x and y are distinct generators, and R(⋅,⋅) is based on a fixed cyclically reduced ...
Mehmet Sefa Cihan
doaj   +1 more source

ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S) [PDF]

open access: yes, 2022
The antiadjacency matrix is one representation matrix of a digraph. In this paper, we find the determinant and the characteristic polynomial of the antiadjacency matrix of a digraph with directed digon(s).
Kiki Ariyanti Sugeng   +3 more
core   +1 more source

Study of Cayley Digraphs over Polygroups

open access: yesMathematics
In this paper we introduce Cayley digraphs associated to finitely generated polygroups, where the vertices correspond to finite products of the generators of polygroups and the edges to multiplication by vertices and generators.
Ali Sanjabi   +4 more
doaj   +1 more source

Practising Digital Product Passport for Circular Supply Chain: Ecosystem Orchestration Perspective

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT Digital product passports (DPP) are emerging as an important tool to support industries in realising circular supply chain (CSC) practices. However, small and medium‐sized enterprises (SMEs) remain constrained by various challenges in implementing DPP.
Martin Agyemang   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy