Results 51 to 60 of about 187 (132)

Reich Graph Contraction in Graphically Extended b‐Metric Spaces With Applications to Cantilever Beam Equation

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

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

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 Proper Diameter of a Graph

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

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

The PI Index of the Deficient Sunflowers Attached with Lollipops

open access: yes, 2020
The Padmakar-Ivan (PI) index is a Wiener-Szeged-like topological index which reflects certain structural features of organic molecules, in this paper we study the PI index of the deficient sunflowers attached with lollipops.
Min Huang, Lili He
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

The general position problem and strong resolving graphs

open access: yesOpen Mathematics, 2019
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj   +1 more source

Comparing Eccentricity-Based Graph Invariants

open access: yesDiscussiones Mathematicae Graph Theory, 2020
The first and second Zagreb eccentricity indices (EM1 and EM2), the eccentric distance sum (EDS), and the connective eccentricity index (CEI) are all recently conceived eccentricity-based graph invariants, some of which found applications in chemistry ...
Hua Hongbo, Wang Hongzhuan, Gutman Ivan
doaj   +1 more source

On kernels by rainbow paths in arc-coloured digraphs

open access: yesOpen Mathematics, 2021
In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no ...
Li Ruijuan, Cao Yanqin, Zhang Xinhong
doaj   +1 more source

Home - About - Disclaimer - Privacy