ON CONNECTED TOTAL DOMINATION POLYNOMIAL OF SOME LEXICOGRAPHIC PRODUCT GRAPHS

DOI10.17654/DM027010147MaRDI QIDQ5076133zbMATH OpenOpenAlexFDO

Authors Giovannie M. Entero, Ariel C. Pedrano

Publication date 16 May 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm027010147

zbMATH Keywords

connected total dominating setsconnected total domination numberconnected total domination polynomiallexicographic product graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• The neighbourhood polynomial of a graph

Cited in

(6)

• On the super domination number of lexicographic product graphs
• Path-connectivity of lexicographic product graphs
• scientific article; zbMATH DE number 6795792 (Why is no real title available?)
• From w-domination in graphs to domination parameters in lexicographic product graphs
• CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS
• FROM GRAPHS TO POLYNOMIAL RINGS: STAR POLYNOMIAL REPRESENTATION OF GRAPHS

This page was built for publication: ON CONNECTED TOTAL DOMINATION POLYNOMIAL OF SOME LEXICOGRAPHIC PRODUCT GRAPHS

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