TY - JOUR
ID - 1768
TI - THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
JO - Journal of Algebraic Systems
JA - JAS
LA - en
SN - 2345-5128
AU - Nasiriboroujeni, Gh. A.
AU - Mirzavaziri, M.
AU - Erfanian, A.
AD - Department of Pure Mathematics, Ferdowsi University of Mashhad, P.O. Box 1159,
Mashhad 91775, Iran.
AD - Department of Pure Mathematics and Center of Excellence in Analysis on Algebraic
Structures, Ferdowsi University of Mashhad, Mashhad, Iran.
Y1 - 2020
PY - 2020
VL - 8
IS - 1
SP - 83
EP - 93
KW - Graph Theory
KW - enumerative in graph theory
KW - enumerative in combinatorics
DO - 10.22044/jas.2019.8314.1411
N2 - To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin 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 Vcup 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}$.
UR - http://jas.shahroodut.ac.ir/article_1768.html
L1 - http://jas.shahroodut.ac.ir/article_1768_14cc474d2aefb94874aaa688ee9a3396.pdf
ER -