Results 71 to 80 of about 6,654 (223)
DIGRAPH EKSENTRIS DARI DIGRAPH [PDF]
, 2002 penelitian ini bertujuan untuk mengetahui bentuk digraph eksentris dari ...
SULISTYOWATI, 089711567
core
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v,w ∈ V (D), (u, v), (v,w) ∈ A(D) implies that (u,w) ∈ A(D).
Hernández-Cruz César
doaj +1 more source
Skew-signings of positive weighted digraphs
Arab Journal of Mathematical Sciences, 2018 An arc-weighted digraph is a pair (D , ω) where D is a digraph and ω is an arc-weight function that assigns to each arc u v of D a nonzero real number ω (u v) .
Kawtar Attas +2 more
doaj +1 more source
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaishun Wang, Yan-Quan Feng
openaire +2 more sources
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Digraph homomorphisms on \(Z_n\)-digraph
Malaya Journal of Matematik, 2020 A graph homomorphism is a mapping between two graphs that respect their structure. In this paper we develop some results related to digraph homomorphisms for the class of \({\overrightarrow{Z_n}}^{-}\)-digraphs. We will begin by giving some standard definitions, then expanding our focus to specifically study different types of digraph homomorphisms. In
null Jimly Manuel, null Bindhu K Thomas
openaire +1 more source
Journal of Algebra Combinatorics Discrete Structures and Applications, 2022 A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of the set are labelled 0 and one half labelled 1. Let $g$ be a labelling of the edge set of a graph that is induced by a labelling $f$ of the vertex set. If both $g$ and $f$ are friendly then $g$ is said to be a {\em cordial} labelling of the graph.
Beasley, LeRoy B. +3 more
openaire +2 more sources
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
Dihedral butterfly digraph and its Cayley graph representation [PDF]
, 2008 In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary.
Tanaka, Yuuki +3 more
core +4 more sources
, 2008 This document describes DiGraph version 0.9. When DiGraph starts it shows its version number. If the number shown is different from the version of this document, then this document is out of date. This document is divided in three main chapters.
Ivan Porres
core