Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graphs with second smallest number of perfect matchings of line graphs.

From MaRDI portal
Publication:5033102
Jump to:navigation, search

MaRDI QIDQ5033102FDOQ5033102


Authors: Yan Liu, Xue Zhou Edit this on Wikidata


Publication date: 22 February 2022





Recommendations

  • A new lower bound for the number of perfect matchings of line graph
  • On the number of perfect matchings of line graphs
  • On the number of perfect matchings in the line graph of a traceable graph
  • Minimizing the \((2n,q)\)-graphs with perfect matchings in terms of the Hosoya index
  • scientific article; zbMATH DE number 4064510


zbMATH Keywords

enumerationline graphperfect matching


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)



Cited In (3)

  • On the number of perfect matchings in the line graph of a traceable graph
  • A new lower bound for the number of perfect matchings of line graph
  • On the number of perfect matchings of line graphs





This page was built for publication: Graphs with second smallest number of perfect matchings of line graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033102)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5033102&oldid=19505876"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 10:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki