Search
Now showing items 221-230 of 256
Edge-maximal graphs without θ 7 -graphs
(
Tokyo University of Science
, 2011 , Article)
Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound ...
A note on the Ramsey number for small graphs
(
Taylor and Francis Ltd.
, 2022 , Article)
Problems in the Ramsey theory form a well-known family of mathematical problems. We present the exact value of the Ramsey number R(θ6, W5), where θ6 is the set of theta graphs of order 6 and W5 is the wheel graph of order ...
Fundamental group and cycle space of dual graphs and applications
(
Elsevier
, 2010 , Article)
In this work, we study the fundamental group of dual graph of a planar graph. Moreover, we show that a planar graph G has no cut vertex if and only if N(Π(D(G))) = N(Π(D(G − v))) − 1 for any v ∈ V(G). Some applications ...
Electronic vs Ionic limitations to electrochemical performance in Li4Ti5O12-based organic suspensions for lithium-redox flow batteries
(
Electrochemical Society Inc.
, 2014 , Article)
Here, we report the electrochemical response of the LTO/KB anolytes vs. lithium as function of the cycling rate in static mode (i.e. no flow) and using a home-made cell. The KB content was fixed at 3 wt% while the LTO ...
Edge Maximal C2k+1-edge Disjoint Free Graphs
(
University of Zielona Gora
, 2012 , Article)
For two positive integers r and s, G(n;r,s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n;r,s) = max{E(G):G ∈ G(n;r,s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we ...
On the sandpile model of modified wheels II
(
De Gruyter Open Ltd
, 2020 , Article)
: We investigate the abelian sandpile group on modified wheels Wˆn by using a variant of the dollar
game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999),
25–45]. The ...
The basis number of the strong product of paths and cycles with bipartite graphs
(
Central Missouri State University
, 2007 , Article)
The basis number of a graph G is defined to be the least integer d such that there is a basis B of the cycle space of G such that each edge of G is contained in at most d members of B. MacLane [13] proved that a graph G ...
On minimum cycle bases of the wreath product of wheels with stars
(
Zenodo
, 2010 , Article)
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle basis is a cycle basis with minimum length. In this work, a construction of a minimum cycle basis for the wreath product of ...
A Novel and Efficient Method for Computing the Resistance Distance
(
Institute of Electrical and Electronics Engineers Inc.
, 2021 , Article)
The resistance distance is an intrinsic metric on graphs that have been extensively studied by many physicists and mathematicians. The resistance distance between two vertices of a simple connected graph $G$ is equal to ...
Edge-Maximal θ2k+1-Edge Disjoint Free Graphs
(
Kyungmoon Publishing
, 2014 , Article)
For two positive integers r and s, G(n; r; θs) denotes to the class of graphs
on n vertices containing no r of edge disjoint θs-graphs and f(n; r; θs) = max{E(G) :
G ∈ G(n; r; θs)}. In this paper, for integers r, k ≥ 2, ...