Results 61 to 70 of about 187 (132)

A Study on Variants of Status Unequal Coloring in Graphs and Its Properties

Journal of Mathematics, Volume 2024, Issue 1, 2024.
Let G∧ be a simple connected graph with vertex set ϑG∧ and edge set ξG∧. The status of a vertex p∈ϑG∧ is defined as ∑q≠pd(p, q). A subset P of ϑG∧ is called a status unequal dominating set (stu‐dominating set) of G∧; for every q∈ϑ−P, there exists p in P such that p and q are adjacent and st(p) ≠ st(q).
Parvathy Gnana Sambandam, Sundareswaran Raman, Sakander Hayat, Swaminathan Venkatasubramanian, Xiaogang Liu   +4 more
wiley   +1 more source

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

Transfer distance between partitions

Partition, Distance, Clustering, Transfer graph, Centrality, 03E02, 05A18, 05C12, 05C35, 05D99, 62G15, 62G30,
Lucile Denœud
core   +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

Antipodal graphs and digraphs

, 1991
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 3, Page 579-586, 1993.
Garry Johns, Karen Sleno
wiley   +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, Klavžar Sandi, Xavier Antony, Arokiaraj Andrew, Thomas Elizabeth   +4 more
doaj   +1 more source

Some properties on the lexicographic product of graphs obtained by monogenic semigroups Proceedings of the International Congress in Honour of Professor Hari M. Srivastava

, 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., Cangül, İ., Daş, K., Akgüneş, N.   +3 more
core   +1 more source

Coloring the vertices of a graph with mutual-visibility property

Open Mathematics
Given 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, Kuziak Dorota, Tripodoro Juan Carlos Valenzuela, Yero Ismael G.   +3 more
doaj   +1 more source

Individualised recovery trajectories of patients with impeded mobility, using distance between probability distributions of learnt graphs [PDF]

MSC: primary, 60-XX; secondary, 05C12; 62H20.Patients who are undergoing physical rehabilitation, benefit from feedback that follows from reliable assessment of their cumulative performance attained at a given time. In this paper, we provide a method for
Zhang, C, Chakrabarty, D, Grosan, C
core   +1 more source

Distance regularity of compositions of graphs

, 2008
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12 Keywords: Distance-regular graphs, compositions of graphs, sum of graphs, Cartesian product of graphs ...
Dragan Stevanović
core