Operations on fuzzy graphs (Q1331033): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some remarks on fuzzy graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On automorphisms of fuzzy graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the group of the composition of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761567 / rank
 
Normal rank

Latest revision as of 16:18, 22 May 2024

scientific article
Language Label Description Also known as
English
Operations on fuzzy graphs
scientific article

    Statements

    Operations on fuzzy graphs (English)
    0 references
    0 references
    0 references
    17 August 1994
    0 references
    Different operations with graphs \(G_ 1\) and \(G_ 2\) yield \(G = g(G_ 1, G_ 2)\). Under a certain hypothesis, necessary and sufficient conditions are derived for ensuring that the application of \(g\), on two fuzzy subgraphs (fsg) of \(G_ 1\) and \(G_ 2\), provides a fsg of \(G\). A proposition establishes when a fsg of \(G\) may be represented by the application of \(g\) on fsg's of \(G_ i\), \(i=1,2\). This result is obtained when \(g\) is the Cartesian product, the composition, the union or the join of \(G_ 1\) and \(G_ 2\). The authors define strong fsg's and give conditions that ensure that such fsg's of \(G_ i\), \(i=1,2\), have the same property under the use of \(g\). Different examples are discussed.
    0 references
    fuzzy graph
    0 references
    completeness
    0 references
    bigraphs
    0 references
    operations
    0 references
    fuzzy subgraphs
    0 references

    Identifiers