QR-Code

On Wiener index of graph complements

Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$. If the graph $G$ has property $(ast)$, then its complement $overline G$ is connected, has diame...

Ausführliche Beschreibung

Gespeichert in:
Bibliografische Detailangaben
Hauptverfasser: Jaisankar Senbagamalar, Jayapal Baskar Babujee, Ivan Gutman
Format: Artigo
Sprache:Inglês
Veröffentlicht: University of Isfahan 2014-06-01
Schriftenreihe:Transactions on Combinatorics
Schlagworte:
Online-Zugang:http://www.combinatorics.ir/pdf_4577_18cb792ce9d2084e2316d673f256f50a.html
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!