@article {
author = {Nasiriboroujeni, Gh. A. and Mirzavaziri, M. and Erfanian, A.},
title = {THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G},
journal = {Journal of Algebraic Systems},
volume = {8},
number = {1},
pages = {83-93},
year = {2020},
publisher = {Shahrood University of Technology},
issn = {2345-5128},
eissn = {2345-511X},
doi = {10.22044/jas.2019.8314.1411},
abstract = {To a simple graph $G=(V,E)$, we correspond a simple graph $G_{\triangle,\square}$ whose vertex set is $\{\{x,y\}: x,y\in V\}$ and two vertices $\{x,y\},\{z,w\}\in G_{\triangle,\square}$ are adjacent if and only if $\{x,z\},\{x,w\},\{y,z\},\{y,w\}\in V\cup E$. The graph $G_{\triangle,\square}$ is called the $(\triangle,\square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the connectedness of $G$ and $G_{\triangle,\square}$.},
keywords = {Graph Theory,enumerative in graph theory,enumerative in combinatorics},
url = {http://jas.shahroodut.ac.ir/article_1768.html},
eprint = {http://jas.shahroodut.ac.ir/article_1768_14cc474d2aefb94874aaa688ee9a3396.pdf}
}