Results 11 to 20 of about 292,611 (264)
Research of NP-Complete Problems in the Class of Prefractal Graphs
NP-complete problems in graphs, such as enumeration and the selection of subgraphs with given characteristics, become especially relevant for large graphs and networks.
Rasul Kochkarov
doaj +3 more sources
Seidel energy of complete multipartite graphs
The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Seidel matrix of G. In this paper we study the Seidel eigenvalues of complete multipartite graphs and find the exact value of the Seidel energy of the ...
Oboudi Mohammad Reza
doaj +2 more sources
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jendrol’, Stanislav +2 more
openaire +4 more sources
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +3 more sources
On the ranks of configurations on the complete graph [PDF]
We consider the parameter rank introduced for graph configurations by M. Baker and S. Norine. We focus on complete graphs and obtain an efficient algorithm to determine the rank for these graphs.
Robert Cori, Yvan Le Borgne
doaj +1 more source
Constructions of new integral graph families
We construct new families of integral graphs by considering complete products, unions and point identifications of complete graphs and complete bipartite graphs.
Thomas Gardemann, Katja Mönius
doaj +1 more source
Seidel Integral Complete Split Graphs [PDF]
In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
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 1-rotational decompositions of complete graphs into tripartite graphs [PDF]
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
On Group-Vertex-Magic Labeling of Simple Graphs
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

