Results 1 to 10 of about 1,092 (193)
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, 2013 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 +2 more sources
Foundational Reading Knowledge of Teachers of Students With IDD: Examining Experience, Degree and Time Use. [PDF]
J Intellect Disabil ResABSTRACT Background Special education teachers require foundational reading content knowledge (e.g., phonemic awareness, phonics) to teach early reading skills. Though many measures have been developed to measure such knowledge, none have examined item‐level differences related to teacher characteristics (i.e., experience, degree and instructional time
Lindström ER +3 more
europepmc +2 more sources
Fuzzy Subgroups and Digraphs Induced by Fuzzy Subgroups [PDF]
Transactions on Fuzzy Sets and Systems, 2022 Given a fuzzy subgroup $\mu$ of a group $G$, $x\rhd_uy$ if and only if $\mu(xy) < \mu(yx)$ defines a directed relation with an associated digraph $(G, \rhd_u)$.
Paul J. Allen +2 more
doaj +1 more source
Action graph of a semigroup act & its functorial connection [PDF]
Categories and General Algebraic Structures with Applications, 2023 In this paper we define C-induced action graph G(S,a,C;A) corresponding to a semigroup act (S,a,A) and a subset C of S. This generalizes many interesting graphs including Cayley Graph of groups and semigroups, Transformation Graphs (TRAG), Group Action ...
Promit Mukherjee +2 more
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source
Ordered-Bipartite Consensus of Multi-Agent Systems under Finite Time Control
Applied Sciences, 2022 Since group consensus (GC) control accounts for one-half of the multi-robot coordination domain, as does complete consensus control, this paper will formulate a certain kind of GC and group bipartite consensus (GBC) in finite time for multi-agent systems
Tiehui Zhang +5 more
doaj +1 more source
Modeling of Barriers to the Adoption of Autonomous Vehicles: DEMATEL Method
Engineering Proceedings, 2023 Autonomous vehicles (AVs) have the potential to increase safety while reducing energy use, pollution, and traffic congestion, to name a few positive effects. Industries, however, are having trouble implementing AVs. The goal of this study was to pinpoint
Karan Ashok Jalwani +1 more
doaj +1 more source
Graph Theory Approach to COVID-19 Transmission by Municipalities and Age Groups
Mathematical and Computational Applications, 2022 The COVID-19 pandemic remains a global problem that affects the health of millions of people and the world economy. Identifying how the movement of people between regions of the world, countries, and municipalities and how the close contact between ...
Pedro Machado +4 more
doaj +1 more source
METHOD OF STRUCTURING BUSINESS MODEL AND MATHEMATICAL MODEL OF DSS OF IT COMPANIES
Фінансово-кредитна діяльність: проблеми теорії та практики, 2021 The problem of creating a decision support system (DSS) for products/services in IT companies using an effective conceptual approach has been solved. The developed mathematical model of DSS for IT-business is represented.
O. Lagovska +4 more
doaj +1 more source
Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators
Journal 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