Results 91 to 100 of about 1,080,603 (189)
Numeracy, 2016 Self-assessment measures of competency are blends of an authentic self-assessment signal that researchers seek to measure and random disorder or "noise" that accompanies that signal.
Edward Nuhfer +4 more
doaj +1 more source
An Odd Characterization of the Generalized Odd Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs;odd-girth;spectra of graphs;spectral excess theorem;spectral ...
Dam, E.R. van, Haemers, W.H.
core
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Evolving Graphs by Graph Programming [PDF]
, 2018 Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the power of graph programming as a representation and as an execution medium in an evolutionary algorithm (EGGP). We demonstrate this power in comparison with Cartesian Genetic Programming (CGP), showing that it is significantly more efficient in terms of ...
Timothy Atkinson 0001 +2 more
openaire +2 more sources
Toric Rings and Ideals of Stable Set Polytopes
Mathematics, 2019 In the present paper, we study the normality of the toric rings of stable set polytopes, generators of toric ideals of stable set polytopes, and their Gröbner bases via the notion of edge polytopes of finite nonsimple graphs and the results on their
Kazunori Matsuda +2 more
doaj +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core
Edge and total choosability of near-outerplanar graphs [PDF]
, 2006 It is proved that, if G is a K4-minor-free graph with maximum degree ∆ ≥ 4, then G is totally (∆ + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ∆ + 1 colours, then every element can be coloured with a colour from ...
Woodall, DR, Hetherington, TJ
core
Multi-Agent System Supporting Automated Large-Scale Photometric Computations
Entropy, 2016 The technologies related to green energy, smart cities and similar areas being dynamically developed in recent years, face frequently problems of a computational nature rather than a technological one.
Adam Sȩdziwy, Leszek Kotulski
doaj +1 more source
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephane Durocher +2 more
openaire +4 more sources
Fractal and FractionalThe purpose of this research work is to propose and develop the notion of α,ψ-contractions in the setting of extended F-metric spaces and to establish corresponding fixed point results.
Badriah Alamri
doaj +1 more source