Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Edge Prime Index of a Graph
View through CrossRef
Relatively Prime Edge labeling extends the notion of prime labeling by considering edges. Prime labeling requires adjacent vertices to possess relatively prime labels, while relatively prime edge labeling requires adjacent edges to have relatively prime labels. The transformation of a coprime edge-labeled graph into a relatively prime edge-labeled graph introduces the concept of Edge Prime Index (or Relatively Prime Index). This study focuses on cases where a coprime edge-labeled graph can be converted into a relatively prime edge-labeled graph by removing certain edges from graph G, thereby establishing the concept of Edge Prime Index. Finally, the Edge Prime Index of some graphs are found.
Title: On Edge Prime Index of a Graph
Description:
Relatively Prime Edge labeling extends the notion of prime labeling by considering edges.
Prime labeling requires adjacent vertices to possess relatively prime labels, while relatively prime edge labeling requires adjacent edges to have relatively prime labels.
The transformation of a coprime edge-labeled graph into a relatively prime edge-labeled graph introduces the concept of Edge Prime Index (or Relatively Prime Index).
This study focuses on cases where a coprime edge-labeled graph can be converted into a relatively prime edge-labeled graph by removing certain edges from graph G, thereby establishing the concept of Edge Prime Index.
Finally, the Edge Prime Index of some graphs are found.
Related Results
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Birecognition of prime graphs, and minimal prime graphs
Birecognition of prime graphs, and minimal prime graphs
Given a graph [Formula: see text], a subset [Formula: see text] of [Formula: see text] is a module of [Formula: see text] if for each [Formula: see text], [Formula: see text] is ad...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Optimizing edge cloud deployments for video analytics
Optimizing edge cloud deployments for video analytics
(English) As our digital world and physical realities blend together, we, as users, are growing to expect real-time interaction wherever and whenever we want. Newer internet servic...
AI-driven zero-touch orchestration of edge-cloud services
AI-driven zero-touch orchestration of edge-cloud services
(English) 6G networks demand orchestration systems capable of managing thousands of distributed microservices under sub-millisecond latency constraints. Traditional centralized app...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...