Results 61 to 70 of about 8,623,913 (295)
On approximating the number of k-cliques in sublinear time [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let $n$ denote the number of vertices in the graph, $m$ the number of edges, and $C_k$ the number of $k$-cliques.
Talya Eden, Dana Ron, C. Seshadhri 0001
openaire +4 more sources
Lower bounds on the signed (total) $k$-domination number depending on the clique number
Communications in Combinatorics and Optimization, 2018 Let $G$ be a graph with vertex set $V(G)$. For any integer $k\ge 1$, a signed (total) $k$-dominating function is a function $f: V(G) \rightarrow \{ -1, 1\}$ satisfying $\sum_{x\in N[v]}f(x)\ge k$ ($\sum_{x\in N(v)}f(x)\ge k$) for every $v ...
L. Volkmann
doaj +1 more source
On General Reduced Second Zagreb Index of Graphs
Mathematics, 2022 Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc.
Lkhagva Buyantogtokh +2 more
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
A Different Short Proof of Brooks’ Theorem
Discussiones Mathematicae Graph Theory, 2014 Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.
Rabern Landon
doaj +1 more source
Ideal based graph structures for commutative rings
Cubo, 2022 We introduce a graph structure $\gamrr$ for commutative rings with unity. We study some of the properties of the graph $\gamrr$. Also we study some parameters of $\gamrr$ and find rings for which $\gamrr$ is split.
M. I. Jinnah, Shine C. Mathew
doaj +1 more source
Clique-to-Clique Monophonic Distance in Graphs
, 2018 It is shown that the clique-to-clique monophonic center a connected graph does not lie in a single block of G.
I. Keerthi Asir (5758471) +1 more
core +1 more source
Exploiting Edge Semantics in Job Shop Scheduling Problem With Heterogeneous Graph Transformers
Advanced Intelligent Systems, EarlyView.A heterogeneous graph transformer (HGT) is introduced for reinforcement learning‐based job shop scheduling by explicitly distinguishing precedence and machine‐contention relations through edge‐type‐specific attention. The proposed framework learns richer scheduling representations, improves decision quality over homogeneous graph models, and highlights
Bulent Soykan, Fatih Kasimoglu
wiley +1 more source
Binary positive semidefinite matrices and associated integer polytopes [PDF]
, 2012 We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M, Letchford, A N
core +4 more sources
Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]
Discrete Mathematics Letters, 2022 Saleem Khan, Shariefuddin Pirzada
doaj +1 more source