Search
Now showing items 1-5 of 5
Edge-Maximal Graphs Without θ2k+1-Graphs
(
Taylor and Francis Ltd.
, 2014 , Article)
Let σ(n; θ2k+1) denote the class of non-bipartite graphs on n vertices having no θ2k+1- graph and f(n; θ2k+1) = max{ ε(G): G ∊ σ (n; θ2k+1)}. In this paper we determine f(n; θ2k+1), by proving that for k ≥ 4 and n ≥ 36k. ...
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 ...
Thermoelectric properties of SbNCa3 and BiNCa3 for thermoelectric devices and alternative energy applications
(
Elsevier B.V.
, 2014 , Article)
Thermoelectric properties of two antiperovskites SbNCa3 and BiNCa3 are calculated using first principles calculations. High values of Seebeck coefficients are observed for these materials. Electrical and thermal conductivities ...
The ramsey number for theta graph versus a clique of order three and four
(
University of Zielona Gora
, 2014 , Article)
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is
the smallest positive integer N with the property that every graph on at
least N vertices contains F1 or its complement contains F2 as a subgraph.
In ...
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, ...