Author/Authors :
NASIRIBOROUJENI ، GH. Department of Pure Mathematics - Ferdowsi University of Mashhad , MIRZAVAZIRI ، M. Department of Pure Mathematics - Ferdowsi University of Mashhad , Erfanian ، A. Department of Pure Mathematics - Center of Excellence in Analysis on Algebraic Structures - Ferdowsi University of Mashhad
Abstract :
To a simple graph G = (V, E), we correspond a sim- ple graph G△,□ whose vertex set is V△,□ = {{x, y} : x, y ∈ V } and two vertices {x, y} and {z, w} are adjacent if and only if {x, z}, {x, w}, {y, z}, {y, w} ∈ E or correspond to a vertex of V . The graph G△,□ is called the (△, □)-edge graph of the graph G. In this paper, our ultimate goal is to provide a link between the connectedness of G and G△,□.
Keywords :
(△ , □) , edge graph , enumerative graph theory , enumerative combinatorics
