Title

An Equation Involving The Neighborhood (Two-Step) And Line Graphs

Abstract

The neighborhood or two-step graph, N(G), of a graph G is the intersection graph of the open neighborhoods of the vertices of G, and L(G) is the line graph of G. The class of graphs for which N[L(G)] ≅ L[N(G)] consists of those graphs for which every component is either K1, K1,3, or Cn where n ≥ 3 and n ≠ 4.

Publication Date

6-1-1999

Publication Title

Ars Combinatoria

Volume

52

Number of Pages

33-50

Document Type

Article

Personal Identifier

scopus

Socpus ID

0039107847 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0039107847

This document is currently not available here.

Share

COinS