On the existence and on the number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-kernels in the lexicographic product of graphs

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

On the existence and on the number of (k,l)-kernels in the lexicographic product of graphs

Cited by 22 publications

References 3 publications

Fibonacci numbers in graphs with strong (1, 1, 2)-kernels

Fibonacci numbers in graphs with strong (1, 1, 2)-kernels

Strong (1, 1, 2)-Kernels in the Corona of Graphs and Some Realization Problems

The Fibonacci numbers of certain subgraphs of circulant graphs

Contact Info

Product

Resources

About