Results 61 to 70 of about 180 (113)
The (1, 2)-step competition graph of a hypertournament
Open Mathematics, 2021 In 2011, Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1,2)\left(1,2)-step competition graph of a digraph. Given a digraph D=(V,A)D=\left(V,A), the (1,2)\left(1,2)-step competition graph of D, denoted C1,2(D){C}_{1,2}\left(D ...
Li Ruijuan, An Xiaoting, Zhang Xinhong
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
Transfer distance between partitions
Partition, Distance, Clustering, Transfer graph, Centrality, 03E02, 05A18, 05C12, 05C35, 05D99, 62G15, 62G30,
Lucile Denœud
core +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
, 2013 In (Das et al. in J. Inequal. Appl. 2013:44, 2013), a new graph [InlineEquation not available: see fulltext.] on monogenic semigroups [InlineEquation not available: see fulltext.] (with zero) having elements [InlineEquation not available: see fulltext ...
Çevik, A. +3 more
core +1 more source
Strong edge geodetic problem in networks
Open Mathematics, 2017 Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul +4 more
doaj +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
On the diameters of friends-and-strangers graphs [PDF]
Given simple graphs \(X\) and \(Y\) on the same number of vertices, the friends-and-strangers graph \(\operatorname{FS}(X, Y)\) has as its vertices all bijections from \(V(X)\) to \(V(Y)\), where two bijections are adjacent if and only if they differ on ...
Jeong, Ryan
core +1 more source
Coloring the vertices of a graph with mutual-visibility property
Open MathematicsGiven a graph GG, a mutual-visibility coloring of GG is a coloring of the vertices of GG satisfying the following. Two vertices x,y∈V(G)x,y\in V\left(G) can be colored with the same color, if there is a shortest x,yx,y-path whose internal vertices have ...
Klavžar Sandi +3 more
doaj +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