Title : ( THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G )
Authors: ghorbanali nasiriboroujeni , Madjid Mirzavaziri , Ahmad Erfanian ,
Full TextAbstract
To a simple graph G = (V;E), we correspond a simple graph G△;□ whose vertex set is V△;□ = ffx; yg : x; y 2 V g and two vertices fx; yg; fz;wg are adjacent if and only if fx; zg; fx;wg; fy; zg; fy;wg 2 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.
@article{paperid:1079767,
author = {Nasiriboroujeni, Ghorbanali and Madjid Mirzavaziri, and Erfanian, Ahmad},
title = {THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G},
journal = {Journal of Algebraic Systems},
year = {2020},
volume = {8},
number = {1},
month = {September},
issn = {2345-5128},
pages = {83--93},
numpages = {10},
keywords = {(△;□)-edge graph; enumerative graph theory; enumerative combinatorics.},
}
%0 Journal Article
%T THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
%A Nasiriboroujeni, Ghorbanali
%A Madjid Mirzavaziri,
%A Erfanian, Ahmad
%J Journal of Algebraic Systems
%@ 2345-5128
%D 2020
