Results 71 to 80 of about 202 (134)
Infant Mental Health Journal: Infancy and Early Childhood, Volume 45, Issue 2, Page 234-246, March 2024.Abstract Improving parental sensitivity is an important objective of interventions to support families. This study examined reliability and validity of parental sensitivity ratings using a novel package of an e‐learning tool and an interactive decision tree provided through a mobile application, called the OK! package.
Mirte L. Forrer +3 more
wiley +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
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 +5 more
core +1 more source
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 +4 more
wiley +1 more source
Comparison between Szeged indices of graphs
, 2020 The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edges e = uv of G, where nu(e) is the number of vertices of G lying closer to u than v, and nv(e) is defined analogously. The aim of this paper is to present
Ghalavand, A +2 more
core
, 2010 In this paper the isometry between two fuzzy graphs is defined. Nature of the isometry relation and concepts regarding isomorphism and isometry is discussed. Antipodal fuzzy graph of the given fuzzy graph is defined.
J Malarvizhi, A Nagoor Gani
core
Characterizations of connected orthogonality graphs of projections of Rickert *-rings
, 2019 In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular.
Waphare, B.N., Patil, Avinash A.
core
Computing the Metric Dimension of a Graph from Primary Subgraphs
Discussiones Mathematicae Graph Theory, 2017 Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . .
Kuziak Dorota +2 more
doaj +1 more source
On the spectral radius and energy of the degree distance matrix of a connected graph
Open MathematicsLet GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +1 more source
On the radius of neighborhood graphs
, 2016 The k-step graph G′k of a graph G has the same vertex set as G and two vertices are adjacent in G ′ k if and only if there exists a path of length k connecting them in G. The graph G ′ 2 is called the neighborhood graph of G.
Vetrík, Tomás, Mukwembi, Simon
core