Results 21 to 30 of about 180 (113)
Eccentricity energy change of complete multipartite graphs due to edge deletion
Special Matrices, 2022 The eccentricity matrix ɛ(G) of a graph G is obtained from the distance matrix of G by retaining the largest distances in each row and each column, and leaving zeros in the remaining ones. The eccentricity energy of G is sum of the absolute values of the
Mahato Iswar, Kannan M. Rajesh
doaj +1 more source
Strong Geodetic Problem in Networks
Discussiones Mathematicae Graph Theory, 2020 In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced.
Manuel Paul +4 more
doaj +1 more source
Proximity, remoteness and maximum degree in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the average ...
Peter Dankelmann +2 more
doaj +1 more source
Inverse Problem on the Steiner Wiener Index
Discussiones Mathematicae Graph Theory, 2018 The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source
A New Transport Distance and Its Associated Ricci Curvature of Hypergraphs
Analysis and Geometry in Metric Spaces, 2022 The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin–Lu– Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a generalization of ...
Akamatsu Tomoya
doaj +1 more source
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2020 If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan +3 more
doaj +1 more source
On the general position number of two classes of graphs
Open Mathematics, 2022 The general position problem is to find the cardinality of the largest vertex subset SS such that no triple of vertices of SS lies on a common geodesic.
Yao Yan, He Mengya, Ji Shengjin
doaj +1 more source
, 2013 In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it. MSC: 05C10,
Cangül, İ. N. +3 more
core +1 more source
Cramér-rao bounds for synchronization of rotations [PDF]
, 2012 Synchronization of rotations is the problem of estimating a set of rotations Ri ∈ SO(n), i = 1... N based on noisy measurements of relative rotations RiR j.
Amit Singer +7 more
core +1 more source