✦ LIBER ✦

The Zagreb indices of graphs with a given clique number

✍ Scribed by Kexiang Xu

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 225 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.01.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is

Sharp upper bounds for Zagreb indices of

Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter

✍ Shuchao Li; Minjie Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 255 KB

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diame

On the Hosoya index and the Merrifield–S

On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number

✍ Kexiang Xu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 377 KB

The Hosoya index and the Merrifield-Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let W n,k be the set of connected graphs with

The maximum number of q-cliques in a gra

The maximum number of q-cliques in a graph with no p-clique

✍ Steven Roman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Nonseparable graphs with a given number

Nonseparable graphs with a given number of cycles

✍ Ranko Šćepanović; Gerhard Ringel; Dragan Marušič; G. L. Chia; Brian Alspach 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract G. Ringel conjectured that for every positive integer __n__ other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with __n__ cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.

On the Ramsey number of trees versus gra

On the Ramsey number of trees versus graphs with large clique number

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3