lexicographic product信息详情
字典式积,字典积
product───n.产品;结果;[数]乘积;作品
product rule───乘法定则;[数]乘积法则
slimmer product───减肥产品
procuring product───采购产品
wrought product───锻制品
hair product───美发产品
a product───一个产品
run product───运行产品
product concept───[经] 生产观点;产品概念
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.───刻划了具有P -正则自同态幺半群的二分图,讨论了字典序积图的自同态幺半群的P -正则性。
cover pebbling number for lexicographic product graphs and some strong product graphs were determined.───图而言,满足此条件的最小的自然数即为此图的覆盖数。
In this article, we study the restricted edge connectivity of strong product and lexicographic product of regular graphs.───本文研究正则图的强乘积图和字典乘积图的限制边连通性。
The endomorphism monoids of the generalized lexicographic product of graphs───广义字典序积的自同态幺半群
The Nullity and Ranks of the Lexicographic Product of Strongly Regular Graphs───强正则图的字典积的零度和秩
Unretractive property of generalized lexicographic product of graphs───图的广义字典序积的不可收缩性
Flows on lexicographic product of graphs───图的字典积的整数流
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.
First, we characterize graphs whose tensor product and lexicographic product admit nowhere-zero 3-flows.
In this article, we study the restricted edge connectivity of strong product and lexicographic product of regular graphs.
The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
- hyperemic
- bloomsbury group
- ken stenzo
- he ofen goes to school
- involve doing sth
- bloomstudios
- anti static
- hyperemine
- hyperemia
- living outside
- living out our dreams
- i like singing very much
- large big
- anti strip ping
- frozen margarita
- living part
- heterocellular ray
- jasmine johansson
- film streaming services
- horse pilot
- lexicographic