Results 31 to 40 of about 72,244 (231)
Extremal Graphs for Sombor Index with Given Parameters
Axioms, 2023 In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters ...
Wanping Zhang, Jixiang Meng, Na Wang
doaj +1 more source
Counting hypergraphs with large girth [PDF]
Journal of Graph Theory, 2022 AbstractMorris and Saxton used the method of containers to bound the number of ‐vertex graphs with edges containing no ‐cycles, and hence graphs of girth more than . We consider a generalization to ‐uniform hypergraphs. The girth of a hypergraph is the minimum such that there exist distinct vertices and hyperedges with for all .
Spiro, Sam, Verstraëte, Jacques
openaire +3 more sources
Characterization of classes of graphs with large general position number
AKCE International Journal of Graphs and Combinatorics, 2020 Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows.
Elias John Thomas, Ullas Chandran S. V.
doaj +1 more source
Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$.
Fadekemi J. Osaye +3 more
doaj +1 more source
Obesity prevalence and associated risk factors in outdoor living domestic horses and ponies [PDF]
, 2014 Reasons for performing study. The prevalence of obesity in companion animals, including horses and ponies has risen drastically in recent years and risk factors have been little investigated.
Giles, Sarah L +3 more
core +3 more sources
The 4-girth-thickness of the complete multipartite graph
, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +1 more source
Triangles and Girth in Disk Graphs and Transmission Graphs [PDF]
, 2019 Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st|
Kaplan, Haim +5 more
core +3 more sources
Diameter and girth of Torsion Graph
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let R be a commutative ring with identity. Let M be an R-module and T (M)* be the set of nonzero torsion elements. The set T(M)* makes up the vertices of the corresponding torsion graph, ΓR(M), with two distinct vertices x, y ∈ T(M)* forming an edge if ...
Rad P. Malakooti +3 more
doaj +1 more source
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Bermond, J. C. +3 more
openaire +2 more sources
American Journal of Neuroradiology, 2014 It is now official: We Americans are no longer the heaviest in the Western World. This ignominious claim belongs south of the border, to Mexico. The obesity rate of Mexicans (32.8%) has now surpassed that of Americans (31.8%).
openaire +2 more sources