Results 21 to 30 of about 547 (79)
A simplified implementation of the least squares solution for pairwise comparisons matrices [PDF]
, 2011 This is a follow up to "Solution of the least squares method problem of pairwise comparisons matrix" by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed.
LS Lasdon +7 more
core +1 more source
On the edge-balanced index sets of product graphs [PDF]
, 2011 We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot +2 more
core +2 more sources
On the number of unlabeled vertices in edge-friendly labelings of graphs [PDF]
, 2011 Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \emph{edge-friendly}.
Cahit +8 more
core +2 more sources
The sparing number of certain graph powers
Acta Universitatis Sapientiae: Mathematica, 2019 Let ℕ0 be the set of all non-negative integers and 𝒫(ℕ0) be its power set. Then, an integer additive set-indexer (IASI) of a given graph G is an injective function f : V(G) → P(ℕ0) such that the induced function f+ : E(G) → 𝒫(ℕ0) defined by f+(uv) = f(u)
Sudev N. K. +2 more
doaj +1 more source
Additive List Coloring of Planar Graphs with Given Girth
Discussiones Mathematicae Graph Theory, 2020 An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
Supermagic Generalized Double Graphs 1
Discussiones Mathematicae Graph Theory, 2016 A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj +1 more source
Zero-sum partitions of Abelian groups of order $2^n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$.
Sylwia Cichacz, Karol Suchan
doaj +1 more source
Constant Sum Partition of Sets of Integers and Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let A = {1, 2, . . . , tm+tn}. We shall say that A has the (m, n, t)-balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A1, A2, . . . , At, B1, B2, . . .
Cichacz Sylwia, Gőrlich Agnieszka
doaj +1 more source
A Variation of Decomposition Under a Length Constraint [PDF]
, 2011 Introducing and initiating a study of a new variation of decomposition namely equiparity induced path decomposition of a graph which is defined to be a decomposition in which all the members are induced paths having same ...
Hamid, Ismail Sahul, Joseph, Mayamma
core +2 more sources
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Discussiones Mathematicae Graph Theory, 2021 An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj +1 more source