✦ LIBER ✦

A metric on the set of connected simple graphs of given order

✍ Scribed by KiranR. Bhutani; Bilal Khan

Publisher: Springer
Year: 2003
Tongue: English
Weight: 176 KB
Volume: 66
Category: Article
ISSN: 0001-9054
DOI: 10.1007/s00010-003-2687-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum order of graphs with give

On the minimum order of graphs with given semigroup

✍ Václav Koubek; Vojtěch Rödl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

On the largest tree of given maximum deg

On the largest tree of given maximum degree in a connected graph

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__δ(__G__) + 1, where δ(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als

On the minimum order of graphs with give

On the minimum order of graphs with given automorphism group

✍ Gert Sabidussi 📂 Article 📅 1959 🏛 Springer Vienna 🌐 English ⚖ 175 KB

ON ORDERING OF THE SYSTEM OF ALL SUBSETS

ON ORDERING OF THE SYSTEM OF ALL SUBSETS OF A GIVEN SET

✍ Milan Sekanina 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 983 KB

Some results on characterizing the edges

Some results on characterizing the edges of connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v • V-V' there exists some u• V' for which {v,u} •E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu