Results 41 to 50 of about 8,697 (224)
ISOMORFISMA DIGRAPH EKSENTRIS DENGAN DIGRAPH ASALNYA [PDF]
, 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
Some Results on 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2017 Let D be a digraph with set of vertices V and set of arcs A. We say that D is k-transitive if for every pair of vertices u, v ∈ V, the existence of a uv-path of length k in D implies that (u, v) ∈ A.
García-Vázquez Patricio Ricardo +1 more
doaj +1 more source
H-kernels by walks in H-colored digraphs and the color-class digraph
AKCE International Journal of Graphs and Combinatorics, 2016 Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Computers & Mathematics with Applications, 1997 The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are ...
Chartrand, G., Tian, S.
openaire +1 more source
Discrete Applied Mathematics30 pages, 17 figures, 5 tables, 61 ...
Nino Basic +3 more
openaire +4 more sources
Proceedings of the American Mathematical Society, 2016 A majority digraph is a finite simple digraph G = ( V ,
Lai, Tri +2 more
openaire +4 more sources
On structural controllability in complex networks with periodic switching topologies
Asian Journal of Control, EarlyView.Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MARCHIORO P. +3 more
openaire +3 more sources
Practising Digital Product Passport for Circular Supply Chain: Ecosystem Orchestration Perspective
Business 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
Business Strategy and the Environment, EarlyView.ABSTRACT Rice production sustains food security and rural livelihoods across many low‐income countries but remains highly vulnerable to climate‐related hazards, including floods, droughts, salinity intrusion and heat stress, which reduce yields and threaten the long‐term sustainability of rice production.
Apurbo Sarkar +4 more
wiley +1 more source