搜索结果: 16-30 共查到“组合数学 graphs”相关记录47条 . 查询时间(0.04 秒)
Note on group distance magic graphs $G[C_4]$
distance magic labeling magic constant sigma labeling graph labeling Abelian group
2012/4/23
A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $...
Bondage number of grid graphs
Domination bondage number Cartesian product graph strong product graphs direct product graphs
2012/4/18
The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than the domination number of $...
Henneberg constructions of some sparse colored graphs
Henneberg constructions some sparse colored graphs Combinatorics
2012/4/18
We give Henneberg-type constructions for some families of sparse colored graphs arising in rigidity theory periodic and forced symmetric frameworks. The proof method, which works with Laman-sparse fin...
On the strong metric dimension of corona product graphs and join graphs
Strong metric dimension strong resolving sets strong metric basis clique number corona graph
2012/4/18
Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A se...
Computing global offensive alliances in Cartesian product graphs
Global offensive alliances domination Cartesian product graphs
2012/4/18
A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The globa...
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
4-regular graph circuit partition Euler system interlacement
2012/4/18
Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement mat...
A sharp upper bound for the rainbow 2-connection number of 2-connected graphs
rainbow edge-coloring rainbow k-connection number 2-connected graph ear decomposition
2012/4/18
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-c...
The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs
acyclic orientation dependent arc source-reversal cover graph generalized Mycielski graph
2012/3/1
Let D be an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let m(G) denote the minimum number of dependent arcs over all acyclic orientations of...
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
Strongly Regular Cayley Graphs, Skew Hadamard Difference Sets, and Rationality of Relative Gauss Sums
strongly regular graph skew Hadamard difference set relative Gauss sum
2012/3/1
In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and our results ...
Maximum spectral radius of graphs with given connectivity and minimum degree
connectivity spectral radius Combinatorics
2011/9/21
Abstract: Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\kappa(G) \...
Monochromatic cycles and the monochromatic circumference in 2-coloured graphs
Monochromatic cycles monochromatic circumference 2-coloured graphs
2011/9/21
Abstract: Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l at least ...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
Normalized graph Laplacians for directed graphs
Normalized graph Laplacians directed graphs Combinatorics
2011/9/20
Abstract: We consider the normalized Laplacian for directed graphs with positive and negative edge weights. We derive basic spectral properties of the normalized Laplacian and identify extremal eigenv...
Abstract: We characterize permutations whose Bruhat graphs can be drawn in the plane. In particular, we show this property, as well as that of having having length at most a fixed l, is characterized ...