Results 41 to 50 of about 9,039,686 (137)
Characterizations of Solutions in Digraph Competitions [PDF]
, 2002 The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on ...
Borm, P.E.M. +5 more
core +1 more source
Science and Technology IndonesiaLet Cay(S,A) be the Cayley digraph of a finite rectangular group S with connection set A. We derive explicit formulas for several vertex-degree–based topological indices of these digraphs, including the Randić, Zagreb, sum-connectivity, geometric ...
Denpong Pongpipat, Nuttawoot Nupo
doaj +1 more source
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
Defence TechnologyThis article investigates a multi-circular path-following formation control with reinforced transient profiles for nonholonomic vehicles connected by a digraph. A multi-circular formation controller endowed with the feature of spatial-temporal decoupling
Jintao Zhang +3 more
doaj +1 more source
The classification of finite groups by using iteration digraphs [PDF]
Czechoslovak Mathematical Journal, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad, Uzma, Moeen, Muqadas
openaire +1 more source
Simultaneous Network Design With Restricted Link Usage
Networks, EarlyView.ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura +3 more
wiley +1 more source
The Automorphism Groups of Minimal Infinite Circulant Digraphs
European Journal of Combinatorics, 1997 Given a group \(G\), a directed graph \(X\) is called a digraph regular representation (DRR) of \(G\) if Aut\((X)\simeq G\) (as abstract groups) and the action of Aut\((X)\) on \(V(X)\) is that of a regular permutation group. It is well known that in this case \(X\) must be a Cayley digraph \(X(G,S)\) where \(S\subset G\) and \(\langle S\rangle=G ...
Jixiang Meng, Qiongxiang Huang
openaire +1 more source
Sustainable Development, EarlyView.ABSTRACT The circular economy (CE) is increasingly promoted as a strategy for addressing environmental degradation and resource inefficiencies. Despite growing policy support, CE implementation remains fragmented in many resource‐intensive industries, particularly in emerging economies. This study investigates barriers to CE adoption in China's textile
Muhammad Shahjahan Usmani
wiley +1 more source
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph [PDF]
, 1992 Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph.
Fiol Mora, Maria Lluïsa +2 more
core +1 more source
Normal Minimal Cayley Digraphs of Abelian Groups
European Journal of Combinatorics, 2000 Let \(G\) be a finite abelian group (additively written) and \(0\) be the neutral element of \(G\). For any subset \(S\) of \(G-\{0\}\), we denote by \(C(G,S)\) the Cayley digraph assigned to the pair \(G\), \(S\). We say that \(C(G,S)\) is minimal if \(S\) is a minimal generating system of \(G\); moreover, \(C(G,S)\) is called normal if the left ...
Jixiang Meng, Bao Ying
openaire +2 more sources