scholarly journals A graph-theoretic characterization of the core in a homogeneous generalized assignment game

2006 ◽  
Author(s):  
Tadeusz Sozański
Keyword(s):  
Assignment Game ◽  
Graph Theoretic ◽  
The Core ◽  
Generalized Assignment ◽  
Theoretic Characterization

A graph-theoretic characterization of structurally fixed modes

Automatica ◽  
1984 ◽  
Vol 20 (2) ◽  
pp. 247-250 ◽  
Author(s):  
V. Pichai ◽  
M.E. Sezer ◽  
D.D. Šiljak
Keyword(s):  
Graph Theoretic ◽  
Theoretic Characterization

scholarly journals Graph-theoretic characterization of cyber-threat infrastructures

2015 ◽  
Vol 14 ◽  
pp. S3-S15 ◽  
Author(s):  
Amine Boukhtouta ◽  
Djedjiga Mouheb ◽  
Mourad Debbabi ◽  
Omar Alfandi ◽  
Farkhund Iqbal ◽  
...  
Keyword(s):  
Graph Theoretic ◽  
Cyber Threat ◽  
Theoretic Characterization

GRAPH-THEORETIC CHARACTERIZATION OF BIFURCATION PHENOMENA IN ELECTRICAL CIRCUIT DYNAMICS

2010 ◽  
Vol 20 (02) ◽  
pp. 451-465 ◽  
Author(s):  
RICARDO RIAZA
Keyword(s):  
Electrical Circuit ◽  
Electrical Circuits ◽  
Graph Theoretic ◽  
Bifurcation Phenomena ◽  
Binet Formula ◽  
Underlying Network ◽  
Matrix Pencils ◽  
Schur Complements ◽  
Theoretic Characterization

This paper addresses bifurcation properties of equilibria in lumped electrical circuits. The goal is to tackle these properties in circuit-theoretic terms, characterizing the bifurcation conditions in terms of the underlying network digraph and the electrical features of the circuit devices. The attention is mainly focused on so-called singular bifurcations, resulting from the semistate (differential-algebraic) nature of circuit models, but the scope of our approach seems to extend to other types of bifurcations. The bifurcation analysis combines different tools coming from graph theory (such as proper trees in circuit digraphs, Maxwell's determinantal expansions or the colored branch theorem) with several results from linear algebra (matrix pencils, the Cauchy–Binet formula, Schur complements). Several examples illustrate the results.

Root Lattices are Efficiently Generated

1997 ◽  
Vol 07 (01) ◽  
pp. 33-50
Author(s):  
Dayanand S. Rajan ◽  
Anil M. Shende
Keyword(s):  
Directed Graph ◽  
Massively Parallel ◽  
Graph Theoretic ◽  
Massively Parallel Computers ◽  
Euclidean Metrics ◽  
Theoretic Characterization ◽  
Physical Phenomena ◽  
Root Lattices ◽  
Ordered Pairs

We show that root lattices are exactly those lattices whose relevant vectors are all equal in length. We define notions of "compatibility" between the euclidean metric and the shortest path metric in the infinite directed graph induced by a subset, G, of a lattice, i.e., the directed graph whose vertices are the points in the lattice, and whose arcs are the ordered pairs (x, x+g), with x a lattice point and g a point in G. We present some ("easy to check for") criteria that a lattice and a subset of it must satisfy to ensure "compatibility" between the corresponding graphical and the euclidean metrics. We use these criteria to characterize, in more than one way, a set of "economically and efficiently generated" lattices, including root lattices. Our results include a "graph theoretic" characterization of root lattices as well. We also discuss, in brief, certain algorithmic considerations in the simulation of macroscopic physical phenomena in massively parallel computers based on suitable discretizations of euclidean space that led us to our graphical treatment of lattices.

Sign in / Sign up

Export Citation Format

Share Document