Results 231 to 240 of about 11,128 (261)
Some of the next articles are maybe not open access.
Extremal graphs for odd wheels
Journal of Graph Theory, 2021AbstractFor a graph , the Turán number of , denoted by ex, is the maximum number of edges of an ‐vertex ‐free graph. Let denote the maximum number of edges not contained in any monochromatic copy of in a 2‐edge‐coloring of . A wheel is a graph formed by connecting a single vertex to all vertices of a cycle of length .
openaire +1 more source
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels
Order, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Charles Golumbic, Vincent Limouzy
openaire +2 more sources
Binding Number and Wheel Related Graphs
International Journal of Foundations of Computer Science, 2017The binding number of a graph G is defined to be the minimum of [Formula: see text] taken over all nonempty [Formula: see text] such that [Formula: see text]. Binding number, one indicator to better understand graph, is an important characteristic quantity of a graph.
Aytac, Vecdi, Berberler, Zeynep Nihan
openaire +4 more sources
On the genus distributions of wheels and of related graphs
Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yichao Chen +2 more
openaire +1 more source
MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS
Bulletin of the Australian Mathematical Society, 2018For a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of $G$. Given a fixed graph $H$ and a positive integer $m$, let $f(m,H)$ denote the minimum possible cardinality of $f(G)$, as $G$ ranges over all graphs on $m$ edges that contain no copy of $H$. Alon et al.
JING LIN, QINGHOU ZENG, FUYUAN CHEN
openaire +2 more sources
The chromaticity of a generalized wheel graph [PDF]
Australas. J Comb., 1997 Summary: We determine the graphs chromatically equivalent to the generalized wheel \(C_5+K_n\).
openaire +1 more source
The Mathematics Teacher, 2019
To introduce sinusoidal functions, I use an animation of a Ferris wheel rotating for 60 seconds, with one seat labeled You (see fig. 1). Students draw a graph of their height above ground as a function of time with appropriate units and scales on both axes. Next a volunteer shares his or her graph. I then ask someone to share a different graph.
openaire +1 more source
To introduce sinusoidal functions, I use an animation of a Ferris wheel rotating for 60 seconds, with one seat labeled You (see fig. 1). Students draw a graph of their height above ground as a function of time with appropriate units and scales on both axes. Next a volunteer shares his or her graph. I then ask someone to share a different graph.
openaire +1 more source
Structure and Recognition of Graphs with No 6-wheel Subdivision
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rebecca Robinson, Graham Farr
openaire +2 more sources
Median problems on wheels and cactus graphs
Computing, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On the Maximum Number of Triangles in Wheel-Free Graphs
Combinatorics, Probability and Computing, 1994Gallai [1] raised the question of determiningt(n), the maximum number of triangles in graphs ofnvertices with acyclic neighborhoods. Here we disprove his conjecture (t(n) ~ n2/8) by exhibiting graphs having n2/7.5 triangles. We improve the upper bound [11] of (n2−n)/6 tot(n) ≤;n2/7.02 +O(n). For regular graphs, we further decrease this bound ton2/7.75 +
Zoltán Füredi +2 more
openaire +2 more sources