Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by janakyMurthy
1
votes
1
answer
1
Graph theory and Applications Bondy and Murty Exercise Qn 1.9
A k partite graph is one where vertex set can be partitioned into k subsets so that no edge has both end in any one subset. A complete k partite graph is one that is simple and in which each vertex is joined to every other vertex that is not ... on n vertices then | E(G) | <= | E(Tm,n)|, with equality only if G isomorphic to Tm,n
A k partite graph is one where vertex set can be partitioned into k subsets so that no edge has both end in any one subset.A complete k partite graph is one that is simpl...
1.0k
views
asked
May 9, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
0
answers
2
os, fork()
Consider the following program. #include <stdio.h> #include <unistd.h> int main() { fork(); fork(); fork(); printf("I am process %d and my parent is %d\n", getpid(), getppid()); return 0; } I can understand that at each fork ... of output where id of parent is printed as 1482. But there is no process created with id 1482. Can someone please explain why this happens?
Consider the following program.#include <stdio.h>#include <unistd.h>int main(){ fork(); fork(); fork(); printf("I am process %d and my parent is %d\n", getpid(), getp...
338
views
asked
Nov 29, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register