Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (Q5085774): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.31801/cfsuasmas.586082 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2956061515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3532226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly multiplicative graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3199455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3199452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some totally modular cordial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the graceful numbering of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Additive Bases and Harmonious Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825114 / rank
 
Normal rank

Latest revision as of 12:10, 29 July 2024

scientific article; zbMATH DE number 7549265
Language Label Description Also known as
English
Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
scientific article; zbMATH DE number 7549265

    Statements

    Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (English)
    0 references
    0 references
    0 references
    27 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    cordial labeling
    0 references
    graph labeling
    0 references
    Cartesian product of graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references