Results 111 to 120 of about 2,268 (146)

Analysis of large scale linear programming problems with embedded network structures: Detection and solution algorithms

, 1998
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Linear programming (LP) models that contain a (substantial) network structure frequently arise in many real life applications.
Gulpinar, Nalan, Guelpinar, N.
core  

The signed matchings in graphs

Discussiones Mathematicae Graph Theory, 2008
openaire   +1 more source

A graph-theoretic condition for irreducibility of a set of cone preserving matrices [PDF]

, 2013
Banaji, Murad, Burbanks, Andrew
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Games on signed graphs

Automatica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuke Li, A. Stephen Morse
openaire   +1 more source

On Some Properties of Signed Cayley Graph Sn

Mathematics, 2022
We define the signed Cayley graph on Cayley graph Xn denoted by Sn, and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph Sn.
Deepa Sinha, Obaidullah Wardak, Ayushi Dhama   +2 more
exaly   +2 more sources

Representations of signed graphs

Journal of Algebraic Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yuqing, Evans, Anthony B, Liu, Xiaoyu, Slilaty, Daniel, Zhou, Xiangqian   +4 more
openaire   +3 more sources

Complexity of planar signed graph homomorphisms to cycles

Discrete Applied Mathematics, 2020
International audienceWe study homomorphism problems of signed graphs from a computational point of view. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept when studying signed graphs is the
Florent Foucaud, Valia Mitsou, Pascal Ochem   +2 more
exaly   +2 more sources

Homomorphisms of Signed Graphs

Journal of Graph Theory, 2014
AbstractA signed graph is a graph G together with an assignment of signs + and − to all the edges of G where Σ is the set of negative edges. Furthermore and are considered to be equivalent if the symmetric difference of Σ1 and Σ2 is an edge cut of G. Naturally arising from matroid theory, several notions of graph theory, such as the theory of minors
Reza Naserasr, Edita Rollová, Éric Sopena   +2 more
openaire   +2 more sources

On graphs with signed inverses

Networks, 1988
AbstractA graph G is called invertible if its adjacency matrix A has an inverse which is the adjacency matrix of some graph H. All such graphs were shown by Harary and Minc to have the form nK2. We now introduce signed invertible (or briefly s‐invertible) graphs G as those whose inverse H is a signed graph.
Fred Buckley, Lynne L. Doty, Frank Harary   +2 more
openaire   +2 more sources

On the Signed Domination in Graphs

Combinatorica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources