Results 31 to 40 of about 8,148 (148)

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +1 more source

Further Results on Resistance Distance and Kirchhoff Index in Electric Networks

Discrete Dynamics in Nature and Society, 2016
In electric circuit theory, it is of great interest to compute the effective resistance between any pairs of vertices of a network, as well as the Kirchhoff index.
Qun Liu, Jia-Bao Liu, Jinde Cao
doaj   +1 more source

Computing Eccentricity Based Topological Indices of Octagonal Grid O n m

Mathematics, 2018
Graph theory is successfully applied in developing a relationship between chemical structure and biological activity. The relationship of two graph invariants, the eccentric connectivity index and the eccentric Zagreb index are investigated with regard ...
Xiujun Zhang, Muhammad Kamran Siddiqui, Muhammad Naeem, Abdul Qudair Baig   +3 more
doaj   +1 more source

Study of eccentricity based topological indices for benzenoid structure

South African Journal of Chemical Engineering, 2023
Topological indices play paramount role in defining chemical and structural properties of different compounds. Chemical graph theory is useful for predicting the bioactivity and physicochemical properties through numerical invariants.
Kamel Jebreen, Hifza Iqbal, Muhammad Haroon Aftab, Iram Yaqoob, Mohammed Issa Sowaity, Amjad Barham   +5 more
doaj   +1 more source

Upper and lower bounds based on linear programming for the b-coloring problem

EURO Journal on Computational Optimization, 2022
B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni, Xiaochen Chou, Derek H. Smith   +2 more
doaj   +1 more source

A SURVEY M-POLAR FUZZY GRAPHS [PDF]

Fiabilitate şi Durabilitate, 2019
I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj  

On almost hypohamiltonian graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj   +1 more source

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

Barekeng
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati   +4 more
doaj   +1 more source

Iwasawa theory for vertex-weighted graphs

29 pages, 8 ...
Murooka, Ryosuke, Tateno, Sohei
openaire   +2 more sources

Knots and Knot-Hyperpaths in Hypergraphs

Mathematics, 2022
This paper deals with some theoretical aspects of hypergraphs related to hyperpaths and hypertrees. In ordinary graph theory, the intersecting or adjacent edges contain exactly one vertex; however, in the case of hypergraph theory, the adjacent or ...
Saifur Rahman, Maitrayee Chowdhury, Firos A., Irina Cristea   +3 more
doaj   +1 more source