Displaying similar documents to “Topological sensitivity analysis for elliptic problems on graphs”

Centers in line graphs

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity:

The irregularity of graphs under graph operations

Hosam Abdo, Darko Dimitrov (2014)

Discussiones Mathematicae Graph Theory

Similarity:

The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and sym- metric difference. We give exact expressions or (sharp) upper bounds on the irregularity of graphs under the...

On the Steiner 2-edge connected subgraph polytope

A. Rhida Mahjoub, Pierre Pesneau (2008)

RAIRO - Operations Research

Similarity:

In this paper, we study the Steiner -edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called the generalized Steiner -partition inequalities, that generalizes the so-called Steiner -partition inequalities. We show that these inequalities together with the trivial and the Steiner cut inequalities completely describe the polytope on a class of graphs that generalizes the wheels. We also describe necessary conditions for these inequalities...