Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with reference-request
Search options not deleted
user 69301
This tag is used if a reference is needed in a paper or textbook on a specific result.
0
votes
1
answer
129
views
Different solution of power Diophantine equation based on constant term
Let us define a power Diophantine equation by 2 algebraic functions $f,g$ (having different degree) and by integers $k, l >0$ where, there are finite solutions for $f(x)+k=g(y)$, but there exists $l$ …
- 267
1
vote
0
answers
235
views
"Graph Individualization"[ reference request] [closed]
Context: I am studying Weisfeiler Lehman method(WL method) and have clear idea about 1 and 2 dimensional WL method. I was wondering about the individualization process described below-
Individualiz …
- 267
2
votes
1
answer
377
views
Graph Isomorphism for Triangle Free graph
Is there any specific computational complexity result of Graph Isomorphism for Triangle Free graphs?
Anything close to the subject will help and of course, I have searched Google.
- 267
0
votes
0
answers
306
views
Graph Coloring: Two adjacent vertices share same color
Consider, subgraphs $G_1, G_2,...... G_x$ of graph $G$. Each subgraph has $k$ vertices.
Now, Fix subgraph $G_1$ and consider another subgraph $G_k$ where $1 <k \le x$.
The edge set between $ …
- 267
4
votes
1
answer
728
views
Is there a error/typo in the proof related to Goormaghtigh equation in Yann Bugeaud's paper?
I found the following theorem in a paper by Yann Bugeaud (page 12) ,
the theorem was not written in detail, to be specific,following two lines on page 13 were not understandable-
I think this …
- 267
2
votes
0
answers
186
views
Classification of Automorphism set of a Regular graph
Let $A$ be the adjacency matrix of an $r$-regular graph $G$ with $n$ vertices (Not complete or cycle graph) . Also, let $Aut(G)$ be the set of all its automorphisms (i.e. set of permutation matrices) …
- 267