Výsledky vyhľadávania - "Graphs and combinatorics"

Local Antimagic Vertex Coloring of a Graph Autor Arumugam, S., Premalatha, K., Bača, Martin, Semaničová-Feňovčíková, Andrea

“…Let G = ( V , E ) be a connected graph with V = n and E = m . A bijection f : E → { 1 , 2 , ⋯ , m } is called a local antimagic labeling if for any two…”
Získať plný text

Isolation of Cycles Autor Borg, Peter

“…For any graph G , let ι c ( G ) denote the size of a smallest set D of vertices of G such that the graph obtained from G by deleting the closed neighbourhood…”
Získať plný text

The Odd Chromatic Number of a Planar Graph is at Most 8 Autor Petr, Jan, Portier, Julien

“…Petruševski and Škrekovski recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph G is said to be odd if for each…”
Získať plný text

Rainbow Connections of Graphs: A Survey Autor Li, Xueliang, Shi, Yongtang, Sun, Yuefang

“…The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published…”
Získať plný text

On Spectral Hypergraph Theory of the Adjacency Tensor Autor Pearson, Kelly J., Zhang, Tan

“…We study both H and E / Z -eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive H or Z…”
Získať plný text

Notes on the Leonard System Classification Autor Terwilliger, Paul

“…Around 2001 we classified the Leonard systems up to isomorphism. The proof was lengthy and involved considerable computation. In this paper we give a proof…”
Získať plný text

Affirmative Solutions on Local Antimagic Chromatic Number Autor Lau, Gee-Choon, Ng, Ho-Kuen, Shiu, Wai-Chee

“…An edge labeling of a connected graph G = ( V , E ) is said to be local antimagic if it is a bijection f : E → { 1 , … , | E | } such that for any pair of…”
Získať plný text

On the Connectivity and Independence Number of Power Graphs of Groups Autor Cameron, Peter J., Jafari, Sayyed Heidar

“…Let G be a group. The power graph of G is a graph with vertex set G in which two distinct elements x ,  y are adjacent if one of them is a power of the other…”
Získať plný text

Spectral Extremal Results with Forbidding Linear Forests Autor Chen, Ming-Zhu, Liu, A-Ming, Zhang, Xiao-Dong

“…The Turán type extremal problems ask to maximize the number of edges over all graphs which do not contain fixed subgraphs. Similarly, their spectral…”
Získať plný text

K_{1,2,2,2}$$ has no n-fold planar cover for $$n<14 Autor Annor, Dickson Y. B., Nikolayevsky, Yuri, Payne, Michael S.

Získať plný text

Noncrossing Longest Paths and Cycles: Noncrossing Longest Paths and Cycles Autor Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel

“…Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency…”
Získať plný text

Callan permutations and odd order permutations Autor Du, Rosena R. X., Lin, Zhicong, Wang, David G. L., Zhao, Tongyuan

“…We call a permutation to be of odd order if writing in cycle form consisting of only odd cycles, and call a permutation to be a Callan permutation if all its…”
Získať plný text

K1,2,2,2 has no n-fold planar cover for n<14 Autor Annor, Dickson Y. B, Nikolayevsky, Yuri, Payne, Michael S

“…S. Negami conjectured in 1988 that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the works of…”
Získať plný text

Total Positivity of Almost-Riordan Arrays: Total Positivity of Almost-Riordan Arrays Autor He, Tian-Xiao, Słowik, Roksana

“…In this paper we study the total positivity of almost-Riordan arrays ( d ( t ) | g ( t ) , f ( t ) ) and establish its necessary conditions and sufficient…”
Získať plný text

Proof of a conjecture of Xiao and Zamora Autor Chen, Wanfang, Lu, Changhong, Yang, Jia-Bao, Yuan, Long-Tu

“…A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the…”
Získať plný text

Upper-embeddability and the decycling number of connected 4-regular graphs: Upper-embeddability and the decycling number of connected 4-regular graphs Autor Long, Shude, Cai, Junliang

“…The decycling number of a graph G , denoted by ∇ ( G ) , is the smallest number of vertices whose removal results in an acyclic subgraph of G . A decycling set…”
Získať plný text

A spectral condition for Hamilton cycles in tough bipartite graphs Autor Ai, Lianyang, Zhang, Wenqian

“…Let G be a graph. The spectral radius of G is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph G with parts X and Y , the…”
Získať plný text

Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph Autor Chiba, Shuya, Tsugaki, Masao, Yamashita, Tomoki, Yashima, Takamasa

“…In 1972, Las Vergnas gave a degree sum conditions for the existence of a perfect matching containing a given matching and for the existence of a Hamilton cycle…”
Získať plný text

An upper bound for a ramsey type problem for k-connected subgraphs Autor Chen, Murong, Xie, Qiqin

“…For any positive integer k , let r 2 ( k ) denote the smallest integer n such that every 2-edge-colored complete graph K n contains a monochromatic k…”
Získať plný text

Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments Autor Di, Yaoxiang, Li, Ruijuan, Zhang, Xinhong

“…Bang-Jensen, Gutin and Yeo [Combin. Probab. Comput. 6(3) (1997) 255–261] investigated hamiltonian cycles avoiding the union of disjoint cliques in tournaments:…”
Získať plný text