INDUCED CYCLE POLYNOMIAL OF A GRAPH
DOI10.17654/0974165823020OpenAlexW4353088612MaRDI QIDQ6115166FDOQ6115166
Authors: Rolito G. Eballe, Rosalio G. Jun. Artes
Publication date: 15 August 2023
Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/0974165823020
Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cites Work
- Limits of chromatic zeros of some families of maps
- Clique polynomials and independent set polynomials of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The neighbourhood polynomial of a graph
- The vertex-cover polynomial of a graph
- Dominating sets and domination polynomials of certain graphs. II
- Matching polynomials and duality
- Title not available (Why is that?)
- On the edge cover polynomial of a graph
- Some problems on chromatic polynomials
- FROM GRAPHS TO POLYNOMIAL RINGS: STAR POLYNOMIAL REPRESENTATION OF GRAPHS
Cited In (4)
This page was built for publication: INDUCED CYCLE POLYNOMIAL OF A GRAPH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115166)