Results 41 to 50 of about 168 (109)
A Characterization for 2-Self-Centered Graphs
Discussiones Mathematicae Graph Theory, 2018 A graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements.
Shekarriz Mohammad Hadi +2 more
doaj +1 more source
Bounds on F-index of tricyclic graphs with fixed pendant vertices
Open Mathematics, 2020 The F-index F(G) of a graph G is obtained by the sum of cubes of the degrees of all the vertices in G. It is defined in the same paper of 1972 where the first and second Zagreb indices are introduced to study the structure-dependency of total π-electron ...
Akram Sana +2 more
doaj +1 more source
On Antipodal and Diametrical Partial Cubes
Discussiones 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
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this article, the first eccentricity connectivity coindex is introduced as ECI¯G=∑uv∉EGε2u+ε2v, in which ε(u) denotes the eccentricity of the vertex u in the simple connected graph G. Then, the exact expressions are obtained for the first eccentricity connectivity coindex of some graph products.
Suha Wazzan +2 more
wiley +1 more source
On resolving edge colorings in graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 46, Page 2947-2959, 2003., 2003 We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
The Second Neighbourhood for Bipartite Tournaments
Discussiones Mathematicae Graph Theory, 2019 Let T (X ∪ Y, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex x ∈ X ∪Y, the second out-neighbourhood N++(x) of x is the set of all vertices with distance 2 from x.
Li Ruijuan, Sheng Bin
doaj +1 more source
Independence Number and Packing Coloring of Generalized Mycielski Graphs
Discussiones 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
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
Veterinary Dermatology, Volume 36, Issue 6, Page 825-837, December 2025.Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster +5 more
wiley +1 more source
Dualizing Distance-Hereditary Graphs
Discussiones 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