The number of spanning trees in a new lexicographic product of graphs (Q1616174): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2261839782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pose-Invariant Face Recognition Using Markov Random Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy cycles and spanning trees with few leaves in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees of a multi-complete/star related graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian spectra and spanning trees of threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic arc-connectivity in a Cartesian product digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the lexicographic product of vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Graph Operations and Related Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs determined by their generalized characteristic polynomials / rank
 
Normal rank

Latest revision as of 05:06, 17 July 2024

scientific article
Language Label Description Also known as
English
The number of spanning trees in a new lexicographic product of graphs
scientific article

    Statements

    The number of spanning trees in a new lexicographic product of graphs (English)
    0 references
    0 references
    1 November 2018
    0 references
    spanning trees
    0 references
    lexicographic product
    0 references
    Laplacian matrix
    0 references
    reliable network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references