Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph
D Rahmadi, IN Ramadhani, CE Dheana… - … of Modelling and …, 2024 - mjomaf.ppj.unp.ac.id
Let G be a graph is a finite set of vertices and edges. A graph G can be defined as a pair of
sets. The minimum cardinality of all distinguishing sets in a graph is called the metric …
sets. The minimum cardinality of all distinguishing sets in a graph is called the metric …
ANTIADJACENCY MATRICES FOR SOME STRONG PRODUCTS OF GRAPHS
A Sutjijana, DA Azka - Journal of Fundamental Mathematics …, 2023 - ejournal2.undip.ac.id
Let G be an undirected graphs with no multiple edges. There are many ways to represent a
graph, and one of them is in a matrix form, by constructing an antiadjacency matrix. Given a …
graph, and one of them is in a matrix form, by constructing an antiadjacency matrix. Given a …