Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

Let G be a undirected graph without loops and multiple edges. By ź ( G ) , ź ( G ) and p ( G ) we respectively denote the nullity… Expand

Is this relevant?

2014

2014

The competition graph of an acyclic directed graph $D$ is the undirected graph on the same vertex set as $D$ in which two… Expand

Is this relevant?

2013

2013

Delayed interactions are a common property of coupled natural systems and therefore arise in a variety of different applications… Expand

Is this relevant?

2012

2012

We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by… Expand

Is this relevant?

2010

2010

This paper addresses the problem of estimating the states of a group of agents from noisy measurements of pairwise differences… Expand

Is this relevant?

2008

2008

We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite… Expand

Is this relevant?

2005

2005

We consider the problem of computing a minimum cycle basis of a directed graph with m arcs and n nodes. We adapt the greedy… Expand

Is this relevant?

2001

2001

An undirected biconnected graph G with non negative weights on the edges is given. In the cycle space associated with G, a… Expand

Is this relevant?

1982

1982

We prove a theorem implying the conjecture of Woodall [14] that, given any k independent edges in a (k+1)-connected graph, there… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Abstract The paper presents several characterizations of outerplanar graphs, some of them are counterparts of the well-known… Expand

Is this relevant?