Results 41 to 50 of about 132 (112)

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 Hamiltonian Number of a Plane Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2019
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj   +1 more source

Improved Bounds for Some Facially Constrained Colorings

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

Facial Rainbow Coloring of Plane Graphs

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

The non-commuting graph of a non-central hypergroup

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

Hamiltonicity of doubly semi-equivelar maps on the torus

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
There 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

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

open access: yesMain Group Metal Chemistry
This 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

On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július   +2 more
doaj   +1 more source

Split Euler Tours In 4-Regular Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts su cient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split ...
Couch PJ   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy