Results 261 to 270 of about 740,582 (289)
Some of the next articles are maybe not open access.
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
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
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 +3 more sources
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
Median problems on wheels and cactus graphs
Computing, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The chromaticity of a generalized wheel graph
Australas. J Comb., 1997Summary: We determine the graphs chromatically equivalent to the generalized wheel \(C_5+K_n\).
openaire +2 more sources
Hamilton Cycle on the Wheel Graph
Journal of Mathematical Sciences and OptimizationThis article discusses the existence of the Hamilton cycle in the wheel graph by constructing steps to find the existence of the Hamilton cycle. A graph that has a Hamilton cycle is called a Hamilton graph, A circle graph is a graph where each vertex has a degree of two, denoted by Cn.
Fadhila Anggraini, Sri Gemawati
openaire +1 more source
Polyhedral Products for Wheel Graphs and Their Generalizations [PDF]
A general homotopy decomposition is established for the based loops on certain poly- hedral products. This is then specialized to obtain an explicit homotopy decomposition for the loops on the moment-angle complex Z_K, where K is a wheel graph or a generalization thereof.
openaire +1 more source