![]() ![]() Zhang Mathematics, Computer Science Australas. Oellermann Computer Science, Mathematics Discret. There are several distance Expand .in Save to Library Create Alert Cite Launch Research Feed Share This Paper 1 Citations View All Figures from this paper figure 2.1 figure 2.2 figure 2.3 figure 3.1 figure 3.2 figure 3.3 figure 3.4 figure 4.1 figure 4.2 figure 5.1 figure 5.2 View All 11 Figures Tables One Citation Citation Type Citation Type All Types Cites Results Cites Methods Cites Background Has PDF Publication Type Author More Filters More Filters Filters Sort by Relevance Sort by Most Influenced Papers Sort by Citation Count Sort by Recency Some family of distance pattern distinguishing graphs and realization results R.Īnanthakumar Computer Science 2020 Save Alert Research Feed References SHOWING 1-10 OF 37 REFERENCES SORT BY Relevance Most Influenced Papers Recency Resolvability in graphs and the metric dimension of a graph G. The distance d(u, v) between two vertices u and v of a connected graph G is the length of a shortest u-v path in G. In Chapter 1, we collect some basic definitions and theorems on graphs which are needed for the subsequent chapters. The order and size of G are denoted by n V and m E respectively.įor graph theoretic terminology we refer to Chartrand and Lesniak 7. Numerical simulations demonstrate that our theoretical results are effective.Ĭorpus ID: 123997731 Studies in graph theory distance related concepts in graphs inproceedingsKumar2013StudiesIG. ![]() ![]() The coordination of dynamical agents is shown under the condition that the error is small enough. The control protocol is designed on the transmitted information by a linear decentralized law.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |