Results 61 to 70 of about 1,092 (193)
Cayley Digraphs of Finite Abelian Groups and Monomial Ideals [PDF]
SIAM Journal on Discrete Mathematics, 2007 In the study of double-loop computer networks, the diagrams known as L-shapes arise as a graphical representation of an optimal routing for every graph’s node. The description of these diagrams provides an efficient method for computing the diameter and the average minimum distance of the corresponding graphs.
Domingo Gómez +2 more
openaire +2 more sources
ANALISIS DIGRAPH DARI TABEL CAYLEY GRUP DIHEDRAL
, 2013 Graph theory is a part of mathematics, in which there are explanations of digraphs. This research, purposed to show a table based on Cayley digraphs depiction dihedral group.
Abidin, Wahyuni
core +1 more source
The Shapley value for directed graph games [PDF]
, 2016 The Shapley value for directed graph (digraph) TU games with limited cooperation induced by a digraph prescribing the dominance relation among the players is introduced.
Khmelnitskaya, A. +4 more
core +3 more sources
Unpacking Entrepreneurial Ecosystem Elements: Insights Into Drivers of Entrepreneurial Activity
Thunderbird International Business Review, Volume 68, Issue 1, Page 3-15, January/February 2026.ABSTRACT Thriving entrepreneurial ecosystems (EEs) are instrumental in new enterprise creation and growth, as they provide vital support for entrepreneurial activity. However, as this support may be context‐specific, the existing literature has yet to capture the contextual factors that shape the contributions of EEs.
Mohamed Yacine Haddoud +4 more
wiley +1 more source
A new Bartholdi zeta function of a digraph II
, 2009 We introduce a new type of the Bartholdi zeta function of a digraph D. Furthermore, we define a new type of the Bartholdi L-function of D, and give a determinant expression of it.
Mizuno, Hirobumi, Sato, Iwao
core +1 more source
IET Collaborative Intelligent Manufacturing, Volume 8, Issue 1, January/December 2026.To identify the I4.0 challenges and sub‐challenges by using literature review for the ready reference of practitioners and future researchers. To develop hierarchical models (Interpretive Structural Modelling [ISM] and Interpretive Ranking Process [IRP]) of the identified challenges for their effective mitigation for the successful adoption of I4.0 ...
Rupen Trehan +7 more
wiley +1 more source
On automorphisms of Cayley-digraphs of abelian groups
Discrete Mathematics, 2003 Suppose \(G\) is a finite additive abelian group, then fix some subset \(B\) of \(G\), such that for the identity element \(0\) of \(G\), \(0\not\in B\). The Cayley-digraph of \(G\) with respect to \(B\) is defined as the digraph \(\Gamma(G,B)\), which has vertex set \(G\) and for any pair of elements \(x,y\) of \(G\) there is an edge from \(x\) to \(y\
openaire +2 more sources
An Iterative Procedure for Evaluating Digraph Competitions [PDF]
, 2000 A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph.Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ...
Borm, P.E.M. +3 more
core
Multimissile Cooperative Guidance Law for Maneuvering Target Interception Based on the ICOA
International Journal of Aerospace Engineering, Volume 2026, Issue 1, 2026.This paper focuses on multimissile cooperative guidance for intercepting multiple maneuvering targets and proposes a guidance law based on an iterative time‐to‐go estimation method. Firstly, an evaluation model for target assignment is established, with special emphasis on the multimissile time coordination matching index. The target assignment problem
Huayu Gao +6 more
wiley +1 more source
Automorphism groups and isomorphisms of Cayley digraphs
Discrete Mathematics, 1998 Let \(G\) be a finite group and \(S\) a subset of \(G\), not containing the identity element 1. The Cayley digraph \(X=\text{Cay} (G,S)\) is defined by \(V(X)=G\) and \(E(X)=\{(g,sg)\;|\;g\in G,\;s\in S\}\). A subset \(S\) of \(G\) is called a CI-subset of \(G\), if for any subset \(T\) of \(G\) with \(\text{Cay} (G,S)\) isomorphic to \(\text{Cay} (G,T)
openaire +2 more sources