Results 41 to 50 of about 180 (113)
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this article, the first eccentricity connectivity coindex is introduced as ECI¯G=∑uv∉EGε2u+ε2v, in which ε(u) denotes the eccentricity of the vertex u in the simple connected graph G. Then, the exact expressions are obtained for the first eccentricity connectivity coindex of some graph products.
Suha Wazzan +2 more
wiley +1 more source
The chromatic sum of a graph: history and recent developments
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 30, Page 1563-1573, 2004., 2004 The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength of a graph is the minimum number of colors necessary to obtain its chromatic sum. A natural generalization of chromatic sum is optimum cost chromatic partition (OCCP) problem, where the costs of colors can be arbitrary positive ...
Ewa Kubicka
wiley +1 more source
GA2 index of some graph operations
, 2010 Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2?
G.H. Fath-Tabar +2 more
core +1 more source
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
Discussiones Mathematicae Graph Theory, 2021 Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj +1 more source
Computing the Radio Number via Multilevel Distance Labelings for Connected Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.Suppose G is a connected graph. For any two vertices s and t, let dG (s,t) denote the distance between s and t in G. The diameter of G is the maximum distance between any pair of vertices, and it is denoted by diam(G). A multilevel distance labeling is a function VG⟶Z+, such that for any two vertices s ≠ t, we have d(s, t) + |f(s) − f(t)| ≥ diam(G) + 1.
Munawwar Hussain +5 more
wiley +1 more source
Topological Invariants for the General Structure of Grape Seed Proanthocyanidins
, 2022 In this paper, we formulate the degree-based topological indicessuch as first Zagreb index, second Zagreb index, third Zagreb index,atom bond connectivity index, geometric-arithmetic (GA) index, generalsum connectivity index, hyper-Zagreb index ...
Muhammad Haroon Aftab; Department of Mathematics and Statistics, The University of Lahore, Lahore +2 more
core
International Journal of Mathematical Combinatorics, Vol.2A [PDF]
, 2008 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
The Smallest Harmonic Index of Trees with Given Maximum Degree
Discussiones Mathematicae Graph Theory, 2018 The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/[d(u) + d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.
Rasi Reza, Sheikholeslami Seyed Mahmoud
doaj +1 more source
Hosoya properties of the commuting graph associated with the group of symmetries
Main Group Metal Chemistry, 2021 A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
Dominant Metric Dimension of Unit Graphs of Finite Commutative Rings
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let R be a finite commutative ring with identity and let U(R) denote its unit group. The unit graph GU(R) is the simple graph on the vertex set R in which distinct vertices x, y are adjacent if and only if x + y ∈ U(R). A dominating resolving set is a vertex set that dominates the graph and resolves all vertices via distance representations; the ...
Eman S. Almotairi, Smritijit Sen
wiley +1 more source