Behavior of the binary rank of a graph when vertices and edges are added
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2021), pp. 21-26
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider the issue of changing the binary rank of the adjacency matrix of a simple graph under adding vertices and some edges. The number of edges that appear after adding a vertex is not constant.
@article{VMUMM_2021_6_a3,
author = {S. Yu. Bezgodova and D. P. Ilyutko},
title = {Behavior of the binary rank of a graph when vertices and edges are added},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {21--26},
publisher = {mathdoc},
number = {6},
year = {2021},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2021_6_a3/}
}
TY - JOUR AU - S. Yu. Bezgodova AU - D. P. Ilyutko TI - Behavior of the binary rank of a graph when vertices and edges are added JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2021 SP - 21 EP - 26 IS - 6 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2021_6_a3/ LA - ru ID - VMUMM_2021_6_a3 ER -
S. Yu. Bezgodova; D. P. Ilyutko. Behavior of the binary rank of a graph when vertices and edges are added. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2021), pp. 21-26. http://geodesic.mathdoc.fr/item/VMUMM_2021_6_a3/