位置：成果数据库 > 期刊 > 期刊详情页
Signed Domination in Kronecker Product of Two Complete Graphs
  • ISSN号：0315-3681
  • 期刊名称：Utilitas Mathematica
  • 时间：2013.7
  • 页码：319-326
  • 相关项目：图的子图横贯与子图回避染色
作者： Zhao, Yancai|Shan, Erfang|Miao, Lianying|
同期刊论文项目
图的子图横贯与子图回避染色
期刊论文 45 会议论文 1
同项目期刊论文
The k-tuple twin domination in generalized de Bruijn and Kautz networks
On the super connectivity of Kronecker products of graphs
完全图与完全多部图的Kronecker积的点脆弱性参数(英文)
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
Signed total domination on Kronecker products of two complete graphs
几类积图的团染色数
正则图的最大-团横贯数与减最大-团横贯数
无爪图上团横贯数的界
一类具有最大末块数和割点数的4-正则图
The p-spectral radius of k-partite and k-chromatic uniform hypergraphs
Signed mixed dominating functions in complete bipartite graphs
Single machine group scheduling with processing times dependent on position, starting time and allot
On the Estrada index of cacti
The numbers of cut-vertices and end-blocks in 4-regular graphs
A labeling algorithm for distance domination on block graphs
Independent sets in -free 4-regular graphs
The 2-maxian problem on cactus graphs
无三角形3-正则图的几个参数的界
最大度为5的图的Alcuin数
Extremal problems for the p-spectral radius of graphs
Coloring clique-hypergraphs of graphs with no subdivision of K5
A note on the security number of grid-like graphs
Constructing the minimum dominating sets of generalized de Bruijn digraphs
Two paths location of a tree with positive or negative weights
Further properties on the degree distance of graphs
The clique-transversal set problem in claw-free graphs with degree at most 4
Independent sets in {claw, K-4}-free 4-regular graphs
Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs
An efficient algorithm for distance total domination in block graphs
Batching scheduling in a two-level supply chain with earliness and tardiness penalties
More on the Harary index of cacti
超图的Alcuin数与其横贯数的关系
Signed total k-domination in graphs
Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing tim
α-相对超曲面的体积变分问题