Displaying similar documents to “Strongly multiplicative graphs”

A note on strongly multiplicative graphs

Chandrashekar Adiga, H.N. Ramaswamy, D.D. Somashekara (2004)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

An upper bound for maximum number of edges in a strongly multiplicative graph

Chandrashekar Adiga, Mahadev Smitha (2006)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ≥ 28.

Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs

Pablo De Caria, Terry A. McKee (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs

Survey of certain valuations of graphs

Martin Bača, J.A. MacDougall, Mirka Miller, Slamin, W.D. Wallis (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.