Results 31 to 40 of about 31,573 (274)
Tur\'an Graphs, Stability Number, and Fibonacci Index
, 2008 The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and ...
A. Knopfmacher +20 more
core +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
Extremal traceable graphs with non-traceable edges [PDF]
Opuscula Mathematica, 2009 By \(\text{NT}(n)\) we denote the set of graphs of order \(n\) which are traceable but have non-traceable edges, i.e. edges which are not contained in any hamiltonian path.
Adam Paweł Wojda
doaj +1 more source
Tur\'an numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions
, 2012 We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be ...
A. Yu. Volovikov +22 more
core +1 more source
Graph Embedded Extreme Learning Machine [PDF]
IEEE Transactions on Cybernetics, 2016 In this paper, we propose a novel extension of the extreme learning machine (ELM) algorithm for single-hidden layer feedforward neural network training that is able to incorporate subspace learning (SL) criteria on the optimization process followed for the calculation of the network's output weights. The proposed graph embedded ELM (GEELM) algorithm is
Pitas, Ioannis +2 more
openaire +4 more sources
Maximal Independent Sets In Graphs With At Most r Cycles
, 2005 We find the maximum number of maximal independent sets in two families of graphs: all graphs with $n$ vertices and at most $r$ cycles, and all such graphs that are also connected.
Diestel +9 more
core +5 more sources
Extremal Edge-Girth-Regular Graphs
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ajda Zavrtanik Drglin +3 more
openaire +3 more sources
LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro
Molecular Oncology, EarlyView.Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix +13 more
wiley +1 more source
Extremal graphs for alpha-index
Revista Integración, 2020 Let N(G) be the number of vertices of the graph G. Let Pl(Bi) be the tree obtained of the path Pl and the trees B1,B2, ...,Bl by identifying the root vertex of Bi with the i-th vertex of Pl. Let Vmn = {Pl(Bi) : N(Pl(Bi)) =n; N(Bi) ≥ 2; l ≥ m}.
Eber Lenes +3 more
doaj
Third Smallest Wiener Polarity Index of Unicyclic Graphs
Frontiers in Physics, 2020 The Wiener polarity index WP(G) of a graph G is the number of unordered pairs of vertices {u,v} where the distance between u and v is 3. In this paper, we determine the third smallest Wiener polarity index of unicyclic graphs. Moreover, the corresponding
Wei Fang +5 more
doaj +1 more source