Contents

Ars Combinatoria

  • Research article

A Characterization of Edge Clique Graphs

Marcia R.Cerioli1, Jayme L.Szwarcfiter2
1Universidade Federal do Rio de Janeiro, Instituto de Matematica and COPPE, Caixa Postal 68530, 21945-970, Rio de Janeiro, RJ, Brasil.
2Universidade Federal do Rio de Janeiro, Instituto de Matematica, Nicleo de Computacao Eletrénica and COPPE, Caixa Postal 2324, 20001-970, Rio de Janeiro, RJ, Brasil.
  • Published: 31/07/2001

Abstract

The edge clique graph of a graph \(G\) is one having as vertices the edges of \(G\), two vertices being adjacent if the corresponding edges of \(G\) belong to a common clique.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Marcia R.Cerioli, Jayme L.Szwarcfiter. A Characterization of Edge Clique Graphs[J], Ars Combinatoria, Volume 060. 287-292. DOI: .