Results 31 to 40 of about 140,780 (247)

Algorithmic Aspects of Secure Connected Domination in Graphs

Discussiones Mathematicae Graph Theory, 2021
Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan, Reddy P. Venkata Subba   +1 more
doaj   +1 more source

Further results on the radio number for some construction of the path, complete, and complete bipartite graphs [PDF]

Heliyon
Baskar Mari, J. Ravi Sankar
openalex   +2 more sources

On vertex stability of complete k-partite graphs [PDF]

Opuscula Mathematica, 2015
Let \(H\) be any graph. We say that graph \(G\) is \(H\)-stable if \(G-u\) contains a subgraph isomorphic to \(H\) for an arbitrary chosen \(u\in V(G)\).
Mateusz Nikodem
doaj   +1 more source

Decomposition of Certain Complete Bipartite Graphs into Prisms

Discussiones Mathematicae Graph Theory, 2017
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj   +1 more source

Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach

Journal of Function Spaces, 2022
For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science.
A. El-Mesady, Omar Bazighifan
doaj   +1 more source

-labeling of supersubdivided connected graph plus an edge

AKCE International Journal of Graphs and Combinatorics, 2020
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj   +1 more source

A note on pm-compact bipartite graphs

Discussiones Mathematicae Graph Theory, 2014
A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj   +1 more source

Decomposition of complete bipartite graphs into cycles and stars with four edges

AKCE International Journal of Graphs and Combinatorics, 2020
Let Ck, Sk denote a cycle, star with k edges and let Km,n denotes a complete bipartite graph with m and n vertices in the parts. In this paper, we obtain necessary and sufficient conditions for the existence of a decomposition of complete bipartite ...
M. Ilayaraja, A. Muthusamy
doaj   +1 more source

Data transfer using complete bipartite graph

, 2017
Information exchange extent is an estimation of the amount of information sent between two focuses on a framework in a given time period. It is an extremely significant perception in present world.
V. M. Chandrasekaran, B. Praba, Abinaya Manimaran, G. Kailash   +3 more
semanticscholar   +1 more source

A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph [PDF]

, 2011
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs, r \ge 3.
Taisei Kudo, A. Takemura
semanticscholar   +1 more source