Results 31 to 40 of about 2,715,030 (252)
ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]
Journal of Algebraic SystemsRecently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi +2 more
doaj +1 more source
Anti-Ramsey theory on complete bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +1 more source
On multiplicity of quadrilaterals
AKCE International Journal of Graphs and Combinatorics, 2015 Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n.
S.S. Rukmani, V. Vijayalakshmi
doaj +1 more source
Matching graphs of Hypercubes and Complete Bipartite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
The IC-Indices of Complete Bipartite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be a connected graph, and let $f$ be a function mapping $V(G)$ into ${\Bbb N}$. We define $f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The function $f$ is called an IC-coloring of $G$ if for each integer $k$ in the set $\{1,2,\cdots,f(G)\}$ there exists an (induced) connected subgraph $H$ of $G$ such that $f(H)=k$, and the IC ...
Chin-Lin Shiue, Hung-Lin Fu
openaire +3 more sources
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
Engineering Ferrimagnetic Interactions in Molecular Quantum Systems
Angewandte Chemie, EarlyView.Heterospin nanographene architectures—constructed by covalently linking spin‐1/2$\nicefrac {1}{2}$ and spin‐1 triangular units via on‐surface synthesis—are characterized by bond‐resolved scanning probe microscopy. Inelastic electron tunneling spectroscopy probes exchange interactions within a Heisenberg model, revealing both compensated (S=0$S=0$) and ...
Elia Turco +8 more
wiley +2 more sources
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
Complete bipartite factorisations by complete bipartite graphs
Discrete Mathematics, 1997 Let \(K_{m,n}\) be the complete bipartite graph on sets of size \(m\) and \(n\). A \(K_{p,q}\)-factor of \(K_{m,n}\) is a spanning subgraph of \(K_{m,n}\) which is a union of vertex-disjoint subgraphs each isomorphic to \(K_{p,q}\). If \(K_{m,n}\) is expressed as a edge-disjoint union of \(K_{p,q}\)-factors, then this union is called a \(K_{p,q ...
openaire +1 more source
Coalition Graphs of Complete Bipartite Graphs
Academic Science JournalA coalition in a graph G= (V, E) consists of two disjoint, non-dominating vertex subsets whose union forms a dominating set, and a coalition graph is constructed from a coalition partition by representing each part as a vertex and connecting two parts ...
Rawaa Khalil Ibrahim
doaj +1 more source