Results 31 to 40 of about 6,840 (159)
Total vertex irregularity strength for trees with many vertices of degree two
Electronic Journal of Graph Theory and Applications, 2020 For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σxy∈E(G) φ(xy).
Rinovia Simanjuntak +2 more
doaj +1 more source
Philosophia Scientiæ, 2005 Carl Friedrich Hindenburg (1741-1808), founder of the “so-called Combinatorial School” (Eugen Netto), had been forgotten until recently. However, an article about him can be found in the Dictionary of Scientific Biography.
Philippe Séguin
doaj +1 more source
IET Intelligent Transport Systems, 2021 Intelligent and connected vehicles are believed to be the future solution to traffic management, especially in highly challenging areas such as intersections.
Lv Dongxin +4 more
doaj +1 more source
Determining finite connected graphs along the quadratic embedding constants of paths
Electronic Journal of Graph Theory and Applications, 2021 The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
On Super Mean Labeling for Total Graph of Path and Cycle
International Journal of Mathematics and Mathematical Sciences, 2018 Let G(V,E) be a graph with the vertex set V and the edge set E, respectively. By a graph G=(V,E) we mean a finite undirected graph with neither loops nor multiple edges. The number of vertices of G is called order of G and it is denoted by p. Let G be a (
Nur Inayah +3 more
doaj +1 more source
On size multipartite Ramsey numbers for stars
Indonesian Journal of Combinatorics, 2020 Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004.
Anie Lusiani +2 more
doaj +1 more source
On 2-power unicyclic cubic graphs
Electronic Journal of Graph Theory and Applications, 2022 In a graph, a cycle whose length is a power of two (that is, 2k) is called a 2-power cycle. In this paper, we show that the existence of an infinite family of cubic graphs which contain only one cycle whose length is a power of 2.
Shariefuddin Pirzada +2 more
doaj +1 more source
Mathematics, 2020 Algebraic thinking, combinatorial thinking and reasoning skills are considered as playing central roles within teaching and learning in the field of mathematics, particularly in solving complex open-ended mathematical problems Specific relations between ...
Janka Medová +2 more
doaj +1 more source
IET Communications, 2021 In clustered distributed storage systems (CDSSs), one of the main design goals is minimizing the transmission cost during the failed storage nodes repairing. Generalized regenerating codes (GRCs) are proposed to balance the intra‐cluster repair bandwidth
Shushi Gu +4 more
doaj +1 more source
Multiple-Solution Tasks in Pre-Service Teachers Course on Combinatorics
Mathematics, 2021 In the paper, we present a study devoted to the utilization of multiple-solution tasks (MSTs) in combinatorics as a part of a pre-service teachers course on didactics of mathematics from the view of the mathematics teachers’ specialized knowledge (MTSK ...
Ingrid Semanišinová
doaj +1 more source