Results 41 to 50 of about 848,049 (294)

Domination Integrity of Line Splitting Graph and Central Graph of Path, Cycle and Star Graphs [PDF]

, 2016
The domination integrity of a connected graph G = (V (G);E(G)) is denoted as DI(G) and defined by DI(G) = min{|S| + m(G - S)}, where S is a dominating set and m(G-S) is the order of a maximum component of G-S. This paper discusses domination integrity of
Mathad, Veena, Mahde, Sultan S.
core   +1 more source

Seidel spectrum for splitting V-vertex join and S-vertex join of graphs

Indonesian Journal of Combinatorics
Splitting V-vertex join and S-vertex join of graphs are the graph structures obtained from splitting graph of a graph. Present work concentrates on the study of Seidel spectrum for the vertex join structures considered.
Harishchandra S. Ramane, Daneshwari D. Patil   +1 more
doaj   +1 more source

Some New Results on Various Graph Energies of the Splitting Graph

Journal of Chemistry, 2019
The energy of a simple connected graph G is equal to the sum of the absolute value of eigenvalues of the graph G where the eigenvalue of a graph G is the eigenvalue of its adjacency matrix AG.
Zheng-Qing Chu, Saima Nazeer, Tariq Javed Zia, Imran Ahmed, Sana Shahid   +4 more
doaj   +1 more source

Investigation of optimized network splitting of large-scale urban centralized heating system operation

Energy Reports, 2020
Operation optimization is a critical issue in the management of the multi-source large-scale urban centralized heating system (UCHS). A major challenge is to deal with the complex topological structure of its heating network. We investigate the operation
Wei Zhong, Jiaying Chen, Yi Zhou, Zhongbo Li, Zitao Yu, Xiaojie Lin   +5 more
doaj   +1 more source

Split graphs

European Journal of Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Ideal Graph of a Graph [PDF]

, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source

On n-connected minors of the es-splitting binary matroids

Electronic Journal of Graph Theory and Applications, 2021
The es-splitting operation on an n-connected binary matroid may not yield an n-connected matroid for (n ≥ 3). In this paper, we show that given an n-connected binary matroid M of rank r, the resulting es-splitting binary matroid has an n-connected minor ...
Prashant Pralhad Malavadkar, Santosh Baburao Dhotre, Maruti Shikare   +2 more
doaj   +1 more source

Split dimension of graphs

Discrete Mathematics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arkady A. Chernyak, Zhanna A. Chernyak
openaire   +1 more source

Degree Splitting Graph on Graceful, Felicitous and Elegant Labeling

, 2012
Graph labeling methods were introduced by Rosa in 1967 or one given by Graham and Sloane in 1980. For a graph G, the splitting graph S(G) is obtained from G by adding for each vertex v of G, a new vertex v′ so that v′ is adjacent to every vertex in ...
J.Renuka, P.Balaganesan, P.Selvaraju, V.Balaj   +3 more
core   +1 more source

Characterizations for split graphs and unbalanced split graphs

, 2021
We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_{2}$, claw)-free graph with $α(G) \geq 3$ is a split graph. Also, we apply it to characterize any pseudo-split graph. Finally, by using edge contraction again, we characterize unbalanced split graphs which we use to characterize the ...
openaire   +2 more sources