Results 51 to 60 of about 168 (109)
On the Eccentric Spectra of the Line Graph of Starlike Trees
Discrete Dynamics in Nature and Society, Volume 2025, Issue 1, 2025.A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.
S. Balamoorthy +4 more
wiley +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
On the Clean Graph of Commutative Artinian Rings
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.For a commutative Artinian ring R with unity, the clean graph Cl(R) is a graph with vertices in the form of an ordered pair (e, u), where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices (e, u) and (f, v) are adjacent in Cl(R) if and only if ef = fe = 0 or uv = vu = 1.
R. Singh +3 more
wiley +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
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.The main focus in this article is to prove the existence and uniqueness of fixed point satisfying Reich graph contraction within the graph structure, in the context of the graphical extended b‐metric spaces. Our findings represent substantial expansions and broader generalizations of certain pioneering results within the current theoretical framework ...
Azham Ilyass +3 more
wiley +1 more source
Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter
Journal of Mathematics, Volume 2025, Issue 1, 2025.For a connected graph G and two real numbers a, b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where V(G) represent the vertex set of graph G, dG(v) denotes the degree of vertex v, and ecG(v) is the eccentricity of v in G, that is, the maximum distance from v to another vertex of G. This index generalizes several well‐
Mesfin Masre, G. Muhiuddin
wiley +1 more source
Veterinary Dermatology, Volume 35, Issue 6, Page 595-604, December 2024.Background – Mycobacterium cell wall fraction (MCWF) is derived from nonpathogenic Mycobacterium phlei and is used as an immunomodulatory compound in clinical practice, yet its mode‐of‐action requires further research. Objective – To evaluate the host response to MCWF in canine peripheral blood mononuclear cells (PBMCs) by using enzyme‐linked ...
Robert Ward +9 more
wiley +1 more source
The Proper Diameter of a Graph
Discussiones Mathematicae Graph Theory, 2020 A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A path is properly colored if consecutive edges have distinct colors, and an edge-colored graph is properly connected if there exists a properly colored path
Coll Vincent +4 more
doaj +1 more source
The normalized distance Laplacian
Special Matrices, 2021 The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source