The tau constant of a metrized graph and its behavior under graph operations.
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity:
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...
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...