Results 51 to 60 of about 156 (133)
Improved Bounds for Some Facially Constrained Colorings
Discussiones Mathematicae Graph Theory, 2023 A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
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
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
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
COMPUTING SOME DISTANCE – BASED TOPOLOGICAL INDICES OF THE CLUSTER CORONA PRODUCT OF KM AND CN
: Distance-based topological indices are graph invariants that characterize graph structures using vertex distances. In this paper, we derive closed-form expressions for several distance-based topological indices of the cluster product of complete ...
Sureshkumar R +2 more
core +1 more source
The non-commuting graph of a non-central hypergroup
Open Mathematics, 2019 The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Iranmanesh Mahdiyeh +2 more
doaj +1 more source
An Introduction on Graph Associahedra
, 2013 By using the algorithm given by Devados [1], we have been worked on the constructionof a graph associahedra, which is a special type of convex polytope. Wehave showed that there is an isomorphism between the set of planar trees withn+1 leaves and the set
Gürbüzer, Sabri Kaan, Akyar, Bedia
core +1 more source
Hamiltonicity of doubly semi-equivelar maps on the torus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaThere are 22 types of doubly semi-equivelar maps, with curvature 0, on the plane which provide infinitely many doubly semi-equivelar maps of respective types on the torus.
Singh Yogendra +2 more
doaj +1 more source
Facial Incidence Colorings of Embedded Multigraphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav +2 more
doaj +1 more source
Degree-based topological properties of borophene sheets
Main Group Metal ChemistryThis study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali +3 more
doaj +1 more source