Results 51 to 60 of about 1,106 (97)

Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter

open access: yesJournal 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

Finite vertex-based resolvability of supramolecular chain in dialkyltin

open access: yesMain Group Metal Chemistry, 2022
For mammals, l-valine, which is a glycogen, is an essential amino acid. A protein made of 20 amino acids, salicylidene and l-valine make the carboxylate ligand which is the base of chiral Schiff.
Zhang Xiujun   +4 more
doaj   +1 more source

Analysis of the immunomodulatory properties of mycobacterium cell wall fraction on the cytokine production of peripheral blood mononuclear cells of healthy dogs

open access: yesVeterinary 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 Metric Dimension of Amalgamation of Cycles [PDF]

open access: yes, 2010
For an ordered set W = {w_1, w_2 , ..., w_k } of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2 ), ..., d (v,w_k )), where d(x,y) represents the distance ...
Baskoro, Edy Tri   +3 more
core  

Testing reliability and validity of practitioner‐rated parental sensitivity: A novel tool for practice

open access: yesInfant 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

On the Distance Spectral Radius of Trees with Given Degree Sequence

open access: yesDiscussiones Mathematicae Graph Theory, 2020
We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth   +2 more
doaj   +1 more source

Eccentricity energy change of complete multipartite graphs due to edge deletion

open access: yesSpecial Matrices, 2022
The eccentricity matrix ɛ(G) of a graph G is obtained from the distance matrix of G by retaining the largest distances in each row and each column, and leaving zeros in the remaining ones. The eccentricity energy of G is sum of the absolute values of the
Mahato Iswar, Kannan M. Rajesh
doaj   +1 more source

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

open access: yesJournal 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

Strong Geodetic Problem in Networks

open access: yesDiscussiones Mathematicae Graph Theory, 2020
In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced.
Manuel Paul   +4 more
doaj   +1 more source

Computing the Metric Dimension of a Graph from Primary Subgraphs

open access: yesDiscussiones 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

Home - About - Disclaimer - Privacy