Results 101 to 110 of about 4,115 (305)
On The Graphs and Their Complements with Prescribed Circumference
Jurnal Ilmu Dasar, 2012 Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and let G ∈ Gt(n). Woodall (1976) determined the maximum number of edges of G.
TA Kusmayadi, L Caccetta
doaj
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Entropy (Basel), 2022 Sason I.
europepmc +1 more source
Extremal graph theory: Ramsey-Turán numbers, chromatic thresholds, and minors
, 2011 This dissertation investigates several questions in extremal graph theory and the theory of graph minors. It consists of three independent parts; the first two parts focus on questions motivated by Turan's Theorem and the third part investigates a ...
Lenz, John E.
core
Advanced Functional Materials, EarlyView.Thermally oxidized MoS2‐based radio‐frequency switches enable a multifunctional platform that unifies broadband RF switching and in‐memory computation. The device achieves a cutoff frequency of 33.2 THz with high energy efficiency and supports hardware‐aware signal processing.
Juho Son +5 more
wiley +1 more source
Graph polynomials for a class of DI-pathological graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent.
James M. Hammer, Joshua Harrington
doaj +1 more source
Extremal Graphs for the Suspension of Edge-Critical Graphs
The Electronic Journal of CombinatoricsThe Turán number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\mathcal{F}$ of graphs, the suspension $\mathcal{F}+v$ of $\mathcal{F}$ is the graph obtained by connecting the vertex $v$ to all vertices of $F$ for each $F\in \mathcal{F}$.
Jianfeng Hou, Heng Li, Qinghou Zeng
openaire +3 more sources
An extremal problem in geodetic graphs
Discrete Mathematics, 1984 In a geodetic graph there is a unique shortest path between any two points. The authors give an upper bound for the number of lines in a connected geodetic graph on p points with diameter d. The problem becomes interesting only when we restrict the class to geodetic blocks.
K. R. Parthasarathy, N. Srinivasan
openaire +2 more sources
Twin Crystal Moiré Metasurfaces for Crossing Flat‐Band Transport
Advanced Functional Materials, EarlyView.This study introduces twin crystal moiré metasurfaces, breaking in‐plane symmetry to enable reconfigurable acoustic wave manipulation. By adjusting the twin angle and interlayer twist angle, various combinations of hyperbolic, flat bands, and elliptic states can be synthesized in the system.
Shida Fan +9 more
wiley +1 more source
On the harmonic index of bicyclic graphs
Communications in Combinatorics and Optimization, 2018 The harmonic index of a graph $G$, denoted by $H(G)$, is defined as the sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math.
R. Rasi
doaj +1 more source
Extremal subgraphs for two graphs
Journal of Combinatorial Theory, Series B, 1985 In this paper we study several interrelated extremal graph problems: (i) Given integers \(n,e,m\), what is the largest integer f(n,e,m) such that every graph with \(n\) vertices and \(e\) edges must have an induced m-vertex subgraph with at least \(f(n,e,m)\) edges? (ii) Given integers \(n,e,e'\), what is the largest integer \(g(n,e,e')\) such that any
Fan R. K. Chung +2 more
openaire +1 more source