Morphology of the connected components of the boolean sum of two digraphs (≤ 5)-hypomorphic up to complementation

Let G = (V, E) and G = (V, E ) be two digraphs, ( 5)-hypomorphic up to complementation, and U := G +G be the boolean sum of G and G .The case where U and U are both connected was studied by the authors and B.Chaari giving the form of the pair

Authors

Institutions

Publication Details

Journal
Advances in Pure and Applied Mathematics
Published
2024-09-01
DOI
https://doi.org/10.21494/iste.op.2024.1198
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Morphology of the connected components of the boolean sum of two digraphs (≤ 5)-hypomorphic up to complementation

Jamel Dammak, Aymen Ben Amira, Hamza Si Kaddour
Advances in Pure and Applied Mathematics
Graph Labeling and Dimension Problems
article

Morphology of the connected components of the boolean sum of two digraphs (≤ 5)-hypomorphic up to complementation

Jamel Dammak, Aymen Ben Amira, Hamza Si Kaddour
article en

Abstract

Let G = (V, E) and G = (V, E ) be two digraphs, ( 5)-hypomorphic up to complementation, and U := G +G be the boolean sum of G and G .The case where U and U are both connected was studied by the authors and B.Chaari giving the form of the pair

Advances in Pure and Applied MathematicsVol. 15(4)
Université Claude Bernard Lyon 1 (FR), Laboratoire de Chimie Théorique (FR), Institut Camille Jordan (FR)
Reduced inequalities
Openalex Percentile: Top 81%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.