✦ LIBER ✦

The convex weighting of a graph and an alternative definition of a matroid

✍ Scribed by Guan Meigu; Li Weixuan; Wang Zheming

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 213 KB
Volume: 48
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90132-8

No coin nor oath required. For personal study only.

✦ Synopsis

In 1976, R.N

📜 SIMILAR VOLUMES

On Hartfiel and Maxson's definition of c

On Hartfiel and Maxson's definition of connected sets of a matroid

✍ James G Oxley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Convex hull of the edges of a graph and

Convex hull of the edges of a graph and near bipartite graphs

✍ J.-F Maurras 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Concept of a vertex in a matroid and 3-c

Concept of a vertex in a matroid and 3-connected graphs

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vert

The threshold weight of a graph

✍ Chi Wang; A. C. Williams 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 612 KB

## Abstract The threshold weight of a graph __G__ is introduced as a measure of the amount by which __G__ differs from being a threshold graph. The threshold graphs are precisely the graphs whose threshold weights are 0. At the opposite extreme is the class of graphs for which the threshold weight

A convex characterization of the graphs

A convex characterization of the graphs of the dodecahedron and icosahedron

✍ Patricia Vanden Cruyce 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Let r be a 3-polytopal graph such that every face of r is convex. We prove that if the set of proper convex subgraphs of r is equal to the set of proper convex subgraphs of the dodecahedron (resp. icosahedron), then F is isomorphic to the dodecahedron (resp. icosahedron).

On some partial line graphs of a hypergr

On some partial line graphs of a hypergraph and the associated matroid

✍ Philippe Jégou; Marie-Catherine Vilarem 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 753 KB

Jegou, P. and M.-C. Vilarem, On some partial line graphs of a hypergraph and the associated matroid, Discrete Mathematics 111 (1993) 3333344. In this paper, we define for a hypergraph H =(X, G) a class of partial graphs of its line graph CR(H);