Results 21 to 30 of about 3,489,698 (302)
Coalition structure generation over graphs [PDF]
, 2012 We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria +5 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 An edge labeled graph is a graph whose edges are labeled with non-zero ideals of a commutative ring . A Generalized Spline on an edge labeled graph is a vertex labeling of by elements of the ring , such that the difference between any two adjacent vertex
Radha Madhavi Duggaraju, Lipika Mazumdar
doaj +1 more source
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
doaj +1 more source
Decomposing complete equipartite graphs into short odd cycles [PDF]
, 2010 In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length.
Cavenagh, Nicholas J. +1 more
core +1 more source
On Group-Vertex-Magic Labeling of Simple Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let A be an Abelian group with identity 0. The A-vertex-magic labeling of a graph G is a mapping from the set of vertices in G to A-{0} such that the sum of the labels of every open neighborhood vertex of v is equal, for every vertex v in G.
Muhammad Husnul Khuluq +2 more
doaj +1 more source
Remarks on $D$-integral complete multipartite graphs [PDF]
, 1975 summary:A graph is called distance integral (or $D$-integral) if all eigenvalues of its distance matrix are integers. In their study of $D$-integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs ...
Pokorný, Milan +3 more
core +1 more source
On 1-rotational decompositions of complete graphs into tripartite graphs [PDF]
Opuscula Mathematica, 2019 Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge.
Ryan C. Bunge
doaj +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Sethuraman 0001, P. Selvaraju
openaire +2 more sources
Intuitionistic Fuzzy Graphs with Categorical Properties
Fuzzy Information and Engineering, 2015 The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +3 more
doaj +1 more source