Results 21 to 30 of about 848,049 (294)

Graph orientation with splits

Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hesam Nikpey, Hirotaka Ono 0001   +4 more
openaire   +1 more source

On the Sombor index and Sombor energy of m-splitting graph and m-shadow graph of regular graphs [PDF]

, 2022
A vertex-degree-based topological index named as Sombor index of a simple graph G with n vertices was recently introduced by I. Gutman. In this paper, we find Sombor index of m-splitting graph and m-shadow graph.
Singh, Randhir, Patekar, S. C.
core  

Radio Heronian Mean k-Graceful Labeling on Degree Splitting of Graphs

Ratio Mathematica, 2023
A mapping g:V\left(G\right)\rightarrow{k,k+1,\ldots,k+N-1} is a radio heronian mean k-labeling such that if for any two distinct vertices s and t of G, d\left(s,t\right)+\left\lceil\frac{g\left(s\right)+g\left(t\right)+\sqrt{g\left(s\right)g\left(t\right)
K Sunitha, K Vimal Rani
doaj   +1 more source

Antimagic Labeling of Some Degree Splitting Graphs

Ratio Mathematica, 2023
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct.  As Wang et al.
Chirag Barasara, Palak Prajapati
doaj   +1 more source

Split Clique Graph Complexity [PDF]

Theoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez   +3 more
openaire   +4 more sources

Token Sliding on Split Graphs [PDF]

Theory of Computing Systems, 2020
We consider the complexity of the Independent Set Reconfiguration problem under the Token Sliding rule. In this problem we are given two independent sets of a graph and are asked if we can transform one to the other by repeatedly exchanging a vertex that is currently in the set with one of its neighbors, while maintaining the set independent.
Belmonte, Rémy, Kim, Eun Jung, Lampis, Michael, Mitsou, Valia, Otachi, Yota, Sikora, Florian   +5 more
openaire   +7 more sources

Auxo: A Temporal Graph Management System

Big Data Mining and Analytics, 2019
As real-world graphs are often evolving over time, interest in analyzing the temporal behavior of graphs has grown. Herein, we propose Auxo, a novel temporal graph management system to support temporal graph analysis.
Wentao Han, Kaiwei Li, Shimin Chen, Wenguang Chen   +3 more
doaj   +1 more source

Representing split graphs by words [PDF]

Discussiones Mathematicae Graph Theory, 2020
There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class of graphs.
Chen, Herman Z.Q., Kitaev, Sergey, Saito, Akira   +2 more
openaire   +5 more sources

ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]

Journal of Algebraic Systems
Recently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi, Sumanta Borah, Ankur Bharali   +2 more
doaj   +1 more source

On Divided-Type Connectivity of Graphs

Entropy, 2023
The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is an ...
Qiao Zhou, Xiaomin Wang, Bing Yao
doaj   +1 more source