Results 201 to 210 of about 187,749 (326)

Metric dimension of cycloparaphenylene and its derived molecular structures. [PDF]

Sci Rep
Prabhu S, Jeba DSR, Arulperumjothi M, Manuel P.   +3 more
europepmc   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

A Study on the Structure of Ideal-Based Non-Zero Divisor Graphs Associated with <i>Z</i> _<i>n</i>. [PDF]

F1000Res
Kadem S, Abd Aubad A.
europepmc   +1 more source

A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]

We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core  

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Modelling π-electron energy of benzenes via Zagreb psi indices. [PDF]

J Comput Aided Mol Des
Yamaç K.
europepmc   +1 more source

Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey

Discrete Mathematics, 2013
Hao Li
semanticscholar   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]

Theory Comput Syst
Bentert M, Fomin FV, Golovach PA.
europepmc   +1 more source

A graph‐theory algorithm for rapid protein side‐chain prediction

Protein Science, 2003
A. Canutescu, A. Shelenkov, R. Dunbrack
semanticscholar   +1 more source