Results 31 to 40 of about 154 (132)
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
Discussiones Mathematicae Graph Theory, 2018 There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source
Generalized Ramsey numbers for paths in 2‐chromatic graphs
International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 2, Page 273-276, 1986., 1985 Chung and Liu have defined the d‐chromatic Ramsey number as follows. Let 1 ≤ d ≤ c and let . Let 1, 2, …, t be the ordered subsets of d colors chosen from c distinct colors. Let G1, G2, …, Gt be graphs. The d‐chromatic Ramsey number denoted by is defined as the least number p such that, if the edges of the complete graph Kp are colored in any fashion ...
R. Meenakshi, P. S. Sundararaghavan
wiley +1 more source
An Exact Determination of the Radio Number of Graph Hn for n ≥ 15
Journal of Mathematics, Volume 2026, Issue 1, 2026.Suppose that G is a connected graph. For any two vertices u and v, let dG (u,v) denote the distance between u and v in G. The diameter of G is the maximum distance between any pair of vertices, and it is denoted by diam(G). A multilevel distance labeling (or radio condition) for G is a function f that assigns to each vertex of G a positive integer such
Munawwar Hussain +5 more
wiley +1 more source
Facial [r,s,t]-Colorings of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source
Computing the Radio Number via Multilevel Distance Labelings for Connected Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.Suppose G is a connected graph. For any two vertices s and t, let dG (s,t) denote the distance between s and t in G. The diameter of G is the maximum distance between any pair of vertices, and it is denoted by diam(G). A multilevel distance labeling is a function VG⟶Z+, such that for any two vertices s ≠ t, we have d(s, t) + |f(s) − f(t)| ≥ diam(G) + 1.
Munawwar Hussain +5 more
wiley +1 more source
Galois connections between sets of paths and closure operators in simple graphs
Open Mathematics, 2018 For every positive integer n,we introduce and discuss an isotone Galois connection between the sets of paths of lengths n in a simple graph and the closure operators on the (vertex set of the) graph.
Šlapal Josef
doaj +1 more source
Non-1-Planarity of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 6, Page 814-824, December 2025.Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency +10 more
wiley +1 more source
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster +5 more
wiley +1 more source