|
|
|
|
simultaneous coloring of vertices and incidences of hypercubes
|
|
|
|
|
|
|
|
نویسنده
|
mozafari-nia mahsa ,iradmusa moharram n.
|
|
منبع
|
communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 1 - صفحه:67 -77
|
|
چکیده
|
An element $i=(v,e)$ of a graph $g$ is called an incidence of $g$, if $vin v(g)$, $ein e(g)$ and $vin e$. the simultaneous coloring of vertices and incidences of a graph is coloring the vertices and incidences of the graph properly at the same time such that any two adjacent or incident elements receive distinct colors. in this paper, we investigate the simultaneous coloring of vertices and incidences of hypercubes.
|
|
کلیدواژه
|
incidence of graph ,simultaneous coloring of graph ,hypercube
|
|
آدرس
|
shahid beheshti university, department of mathematical sciences, iran, shahid beheshti university, department of mathematical sciences, iran
|
|
پست الکترونیکی
|
m_iradmusa@sbu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|