Treffer: On the matching polynomial of subdivision graphs
Title:
On the matching polynomial of subdivision graphs
Authors:
Source:
Discrete applied mathematics. 157(1):195-200
Publisher Information:
Kidlington: Elsevier, 2009.
Publication Year:
2009
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Problèmes combinatoires classiques, Classical combinatorial problems, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Recherche information. Graphe, Information retrieval. Graph, Combinatoire, Combinatorics, Combinatoria, Couplage graphe, Graph matching, Acoplamiento grafo, Fonction génératrice, Generating function, Función generatriz, Graphe biparti, Bipartite graph, Grafo bipartido, Graphe régulier, Regular graph, Grafo regular, Inclusion, Inclusión, Indice, Index, Informatique théorique, Computer theory, Informática teórica, Optimisation, Optimization, Optimización, Polynôme, Polynomial, Polinomio, 05A19, 68R10, Application combinatoire, Graphe simple, Longueur chemin, Terme, Hosoya index, Matching generating function, Matching polynomial, Subdivision
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
School of Sciences, Jimei University, Xiamen 361021, China
Institute of Mathematics, Academia Sinica, Taipei 11529, Tawain, Province of China
Institute of Mathematics, Academia Sinica, Taipei 11529, Tawain, Province of China
ISSN:
0166-218X
Rights:
Copyright 2009 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.20946652
Database:
PASCAL Archive
Weitere Informationen
Let G be a simple graph and let S(G) be the subdivision graph ofG, which is obtained from G by replacing each edge of G by a path of length two. In this paper, by the Principle of Inclusion and Exclusion we express the matching polynomial and Hosoya index ofS(G) in terms of the matchings ofG. Particularly, if G is a regular graph or a semi-regular bipartite graph, then the closed formulae of the matching polynomial and Hosoya index ofS(G) are obtained. As an application, we prove a combinatorial identity.