ArticleCurrent organic synthesis2025
Omega Indices of Strong and Lexicographic Products of Graphs.
Article in Current organic synthesis, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundThe degree sequence of a graph is the list of its vertex degrees arranged in usually increasing order. Many properties of the graphs realized from a degree sequence can be deduced by means of a recently introduced graph invariant called omega invariant.
methodsWe used the definitions of the considered graph products together with the list of degree sequences of these graph products for some well-know graph classes. Naturally, the vertex degree and edge degree partitions are used. As the main theme of the paper is the omega invariant, we frequently used the definition and fundamental properties of this very new invariant for our calculations. Also, some algebraic properties of these products are deduced in line with some recent publications following the same fashion.
resultsIn this paper, we determine the degree sequences of strong and lexicographic products of two graphs and obtain the general form of the degree sequences of both products. We obtain a general formula for the omega invariant of strong and lexicographic products of two graphs. The algebraic structures of strong and lexicographic products are obtained. Moreover, we prove that strong and lexicographic products are not distributive over each other.
conclusionWe have obtained the general expression for degree sequences of two important products of graphs and a general expression for omega invariants of strong and lexicographic products. Furthermore, we have obtained algebraic structures of strong and lexicographic products in terms of their degree sequences. Also, it has been found that the disruptive property does not hold for strong and lexicographic products.
Indexed as
Identifiers
39962955What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.