Results 11 to 20 of about 140 (88)

On the general position number of two classes of graphs

open access: yesOpen Mathematics, 2022
The general position problem is to find the cardinality of the largest vertex subset SS such that no triple of vertices of SS lies on a common geodesic.
Yao Yan, He Mengya, Ji Shengjin
doaj   +1 more source

On Antipodal and Diametrical Partial Cubes

open access: yesDiscussiones Mathematicae Graph Theory, 2021
We prove that any diametrical partial cube of diameter at most 6 is antipodal. Because any antipodal graph is harmonic, this gives a partial answer to a question of Fukuda and Handa [Antipodal graphs and oriented matroids, Discrete Math.
Polat Norbert
doaj   +1 more source

Independence Number and Packing Coloring of Generalized Mycielski Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(x) + 1 ...
Bidine Ez Zobair   +2 more
doaj   +1 more source

Dualizing Distance-Hereditary Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj   +1 more source

Asymptotic Behavior of the Edge Metric Dimension of the Random Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj   +1 more source

Hosoya properties of the commuting graph associated with the group of symmetries

open access: yesMain Group Metal Chemistry, 2021
A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam   +4 more
doaj   +1 more source

Transdermal drug delivery in horses: An in vitro comparison of skin structure and permeation of two model drugs at various anatomical sites

open access: yesVeterinary Dermatology, Volume 34, Issue 3, Page 235-245, June 2023., 2023
Background – Oral and parenteral drug delivery in horses can be difficult. Equine‐specific transdermal drug formulations offer improved ease of treatment; development of such formulations requires a deeper understanding of the structural and chemical tissue barrier of horse skin. Hypothesis/Objectives – To compare the structural composition and barrier
Samuel C. Bizley   +3 more
wiley   +1 more source

Influence of hospital size on antimicrobial resistance and advantages of restricting antimicrobial use based on cumulative antibiograms in dogs with Staphylococcus pseudintermedius infections in Japan

open access: yesVeterinary Dermatology, Volume 32, Issue 6, Page 668-e178, December 2021., 2021
Background Antimicrobial resistance in Staphylococcus pseudintermedius (SP) and the prevalence of meticillin‐resistant SP (MRSP) is increasing in dogs worldwide. Objectives To evaluate the influence of hospital size on antimicrobial resistance of SP and whether restricted use of antimicrobials based on antibiograms could reduce the identification of ...
Keita Iyori   +5 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

Home - About - Disclaimer - Privacy