메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject
Humanities
General Humanities History Philosophy Religious Studies Linguistics and Literature Other Humanities
Social science
General Social Science Business Management Tourism Education Military Science Library and Information Science Law Sociology Journalism and Media Studies Psychological Science Political Science and Diplomacy Geography Public Administration Economics International Trade Anthropology Other Social Science
Natural science
General Natural Science Physics Biology Life Sciences Mathematics/Statistics Astronomy Earth Science Chemistry Other Natural Science
Engineering
General Engineering Architectural Engineering Mechanical Engineering Industrial Engineering Material/Energy Engineering Electrical and Electronic Engineering Marine and Ocean Engineering Chemical Engineering Computer Science Other Engineering
Medical science
General Medical Science Nursing Science Veterinary Pharmacy Traditional Korean Medicine Basic Medicine Clinical Medicine Other Medicine
Agriculture and Fishery
General Agriculture and Fishery Agriculture Fishery Science Food Science Forestry Animal Husbandry Marine Transportation Studies Other Agriculture and Fishery
Art and Kinesiology
General Arts Design Fine Arts Cosmetology Photography Music Fashion Kinesiology Performing Media Arts Other Arts and Kinesiology
Interdisciplinary Studies
Interdisciplinary Research Science and Technology Studies Brain and Cognitive Science Technology Policy Other Interdisciplinary Studies

KOR

Bounding the Search Number of Graph Products
Recommendations
Search

논문 기본 정보

Type
Academic journal
Author
Journal
경북대학교 자연과학대학 수학과 Kyungpook Mathematical Journal Kyungpook Mathematical Journal 제59권 제1호 KCI Accredited Journals
Published
2019.1
Pages
175 - 190 (16page)

Usage

cover
Bounding the Search Number of Graph Products
Ask AI
Recommendations
Search

Abstract· Keywords

Report Errors
In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.

Contents

No content found

References (21)

Add References
B. Alspach / 2004 / Searching and sweeping graphs : a brief survey / Matematiche(Catania) 59:5~37 google schola H. L. Bodlaender / 1998 / A partial k-arboretum of graphs with bounded treewidth / Theoret. Comput. Sci 209:1~45 google schola H. L. Bodlaender / 1988 / Dynamic programming algorithms on graphs with bounded treewidth / Proc. 15th Intemat. Coil. on Automata, Languages and Programming, Lecture Notes in Computer Science 317:105~119 google schola H. L. Bodlaender / 1993 / The pathwidth and treewidth of cographs / SIAM J. Discrete Math 6:181~188 google schola D. Dyer / 2004 / Sweeping graphs and digraphs google schola

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Recently viewed articles

A Study on Education related to Hate Speech in Social Studies
Koo Jeong HwaAssociation of Society Education in Korea2018

Comments(0)

0

Write first comments.